717. 1-bit and 2-bit Characters*

717. 1-bit and 2-bit Characters*

https://leetcode.com/problems/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.

C++ 实现 1

这题大意是: 存在两个 character, 分别用 1-bit (0 表示) 或 2-bit (11 或 10 表示), 现在给定一个字符串, 字符串结尾始终为 0. 现在要判断这个字符串最后是否一定是用 1-bit 的 character 结尾的.

要解决这道题, 需要注意到, 在遍历字符串的过程中, 如果 bits[i] = 1, 那么必然是一个 2-bit character, 至于下一位 bits[i + 1] 是 0 还是 1, 可以不用关心. 而如果 bits[i] = 0, 那么必然是一个 1-bit character (注意对于 10 首先遇到的是 1 而不是 0), 可以不用做处理, 继续遍历. 最终, 如果字符串是以 1-bit character 结尾的, 那么 i 将刚好指向字符串最后一位. 否则字符串将以 2-bit character 结尾.

代码 beats 100%.

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