(算法分析Week18)1-bit and 2-bit Characters[Easy]

717. 1-bit and 2-bit Characters[Easy]

题目来源

Description

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.

Example1:

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.

Example2:

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.

Solution

很简单的一道题。
规定两种特殊的字符，一种是两位字符，只能是11或者10，另一种是只能是二进制的0。给出一个01数组，问是否能够正确分割。
两种字符互不干扰，只要我们遍历到了数字1，那么必定是11或者10，后面一位可以忽略不看，如果是数字0，那么就必定是单个位字符。

因此从头开始遍历，如果遇到1，i+=2，否则i+=1，利用一个临时变量记录此时是0还是1，如果最后该临时变量值为0，则说明可以分割（因为规定最后一位必定是0）。

Complexity analysis

O（n）

Code

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

Result