首页 > itarticle > leecode-717. 1-bit and 2-bit characters

leecode-717. 1-bit and 2-bit characters

admin 11月 13, 2020 0

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.

思路：判断列表长度，当列表长度为1的时候返回True, 判断列表头，为1的时候可以移除列表头2位，为0的时候可以移除1位，持续这个过程，最后如果列表为空就是False。

class (object):
    def isOneBitCharacter(self, bits):
        """
        :type bits: List[int]
        :rtype: bool
        """
        if len(bits) == 1:
            return True
        while True:
            if len(bits) == 1:
                return True
            elif len(bits) == 0:
                return False
            if bits[0] == 0:
                bits.pop(0)
            else:
                bits.pop(0)
                bits.pop(0)