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
or11
).
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:TrueExplanation: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:FalseExplanation: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
从看题开始,每个character由0,或者由10、11组成,bits里面有多个character。判断最后一个character是否由一位的0组成。
class Solution:
def isOneBitCharacter(self, bits):
length = len(bits)
i = 0
while(i<length):
if i == length-1:
return True
if bits[i] == 1:
i += 2
else:
i += 1
return False
python里面没有i ++
的用法,用i += 1
代替。