题目
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.
链接
https://leetcode.com/problems/1-bit-and-2-bit-characters/
分析
题目意思就是判断除了最后一个字符之后能否分割成two special characters;
code
class Solution(object):
def isOneBitCharacter(self, bits):
"""
:type bits: List[int]
:rtype: bool
"""
if len(bits) < 1:
return True
if bits[-1] != 0:
return False
return self.isExpectCharacters(bits[:-1]) ## 判断除了最后一个字符之后能否分割成two special characters
def isExpectCharacters(self, bits):
"""
动态规划的思想去做;
传进来的bits长度为0时则直接返回True;
最后两位:
00: 验证bits[:-1]
10: 验证bits[:-2]
01: 无需验证,肯定是不满足
11:验证bits[:-2]
"""
re = False
if len(bits) == 0:
return True
if len(bits) == 1 and bits[0] == 0:
return True
if bits[-1] == 0:
re = re or self.isExpectCharacters(bits[:-1])
if len(bits) >= 2 and bits[-2] == 1:
re = re or self.isExpectCharacters(bits[:-2])
else:
if len(bits) >= 2 and bits[-2] == 1:
re = re or self.isExpectCharacters(bits[:-2])
return re