717. 1-bit and 2-bit Characters

Posted 2020-10-13 lvbbg

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.

 

 1 class Solution {
 2 public:
 3     bool isOneBitCharacter(vector<int>& bits) {
 4         int n = bits.size();
 5         int i = 0;
 6         while(i < n - 1)
 7         {
 8             if(bits[i] == 0) i++;
 9             else i += 2;
10         }
11         return i == n - 1 ? true : false;
12     }
13 };