LeetCode--717. 1-bit and 2-bit Characters

本文介绍了一种识别字符串中特定一比特字符的算法。通过遍历数组并利用条件判断，可以确定给定字符串的最后一个字符是否为指定的一比特字符。文章提供了一个具体的实现示例。

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.

题意：给定一个数组，其中只包含0或1，我们用数组中的一位的0表示字符1，用两位的10或11表示字符2，问你最后一个字符是否一定是一位的字符1。

思路：

1.遍历数组，每次碰到1，就跳一次，并判断当前数字是否为最后一位n-1，如果是，说明最后一个字符是2位的字符，返回false，否则返回true。

参考代码：

class Solution {
public:
    bool isOneBitCharacter(vector<int>& bits) {
        int n=bits.size();
        for(int i=0;i<n;++i){
            if(bits[i]==1){
                ++i;
                if(i==n-1) return false;
            } 
        }
        return true;
    }
};