版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u013554860/article/details/83819885
https://leetcode.com/problems/1-bit-and-2-bit-characters/description/
class Solution {
public:
bool isOneBitCharacter(vector<int>& bits) {
int n = bits.size(), i = 0;
while (i<n-1) {
if(bits[i]==0) i+=1;
else i+=2;
}
return i ==n-1;
}
};
