717. 1-bit and 2-bit Characters

最新推荐文章于 2020-12-23 11:33:30 发布

原创最新推荐文章于 2020-12-23 11:33:30 发布 · 136 阅读

0 ·

CC 4.0 BY-SA版权

Python 同时被 2 个专栏收录

78 篇文章

订阅专栏

Leetcode

43 篇文章

订阅专栏

本文探讨了一种特殊的字符编码方案，其中两种字符分别由一比特和两比特表示。文章提供了一个算法，用于判断给定比特串的最后一个字符是否必定为一比特字符。通过解析比特串并应用特定的步骤，可以确定字符类型，从而解决实际问题。

摘要生成于 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
        """
        //bits[i]is 1,take two steps move forwards,bits[i]is 0,take one step move
        i=0
        if bits[-1] != 0:
            return False
        while i< len(bits)-1:
            if bits[i]==0:
                i=i+1
            elif bits[i]==1:
                i=i+2
            if i > len(bits)-1:
                return False
        return True