717. 1-bit and 2-bit Characters

原创于 2017-10-30 20:28:53 发布 · 259 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python

leetcode 同时被 2 个专栏收录

46 篇文章

订阅专栏

python

4 篇文章

订阅专栏

本文介绍了一种算法，用于判断给定比特串的最后一个字符是否为一比特长的特殊字符。通过遍历比特串并解析每个字符的长度，可以确定最后一个字符的长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11).
Now given a string represented by several bits. Return whether the last character must be a one-bit character or not. The given string will always end with a zero.
Example 1:
Input:
bits = [1, 0, 0]
Output: True
Explanation:
The only way to decode it is two-bit character and one-bit character. So the last character is one-bit character.

Example 2:
Input:
bits = [1, 1, 1, 0]
Output: False
Explanation:
The only way to decode it is two-bit character and two-bit character. So the last character is NOT one-bit character.

Note:
1 <= len(bits) <= 1000.
bits[i] is always 0 or 1.

class Solution:
    def isOneBitCharacter(self, bits):
        """
        :type bits: List[int]
        :rtype: bool
        """
        l=len(bits)
        i=0
        while i<l:
            if bits[i]==1:
                i=i+2
                if i>=l:
                    return False
            if bits[i]==0:
                i=i+1
                if i>=l:
                    return True