717. 1-bit and 2-bit Characters

• Difficulty: Easy

• Topics: Array

• Similar Questions:

  • Gray Code

Problem:

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:

Solutions:

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

        return oneBit;
    }
};