链接:
https://leetcode-cn.com/problems/1-bit-and-2-bit-characters/
描述:
示例:
代码:
class Solution {
public:
bool isOneBitCharacter(vector<int>& bits) {
int len = bits.size();
int i = 0;
while(i<len)
{
if(bits[i] == 0 && i == len-1) return true;
else if(bits[i] == 1) i+=2;
else i++;
}
return false;
}
};