[LeetCode]717. 1-bit and 2-bit Characters 解题报告(C++)

[LeetCode]717. 1-bit and 2-bit Characters 解题报告(C++)

题目描述

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.

题目大意

• 一个字符串由三种字符构成 0 , 10 , 11 .
• 现在要判断这个字符串是不是以 0 结尾.

解题思路

方法1:

• 从头开始遍历到 n-1.
• 若 是 0 ,则判断下一个.
• 若 不是 0 则需要调用两个.
• 最后循环结束的时候. 用来遍历的变量 i 的值.
  
  • 若是 n-1. 则末尾是0.
  • 若不是 n-1. 则末尾不是0.

代码实现:

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

方法2:

• 使用递归的思路进行求解.
• 若遍历到的当前数字是0. 对剩下的 [i+1,n-1] 进行判断.
• 若不是0, 对剩下的 [i+2,n-1] 进行判断.
• 真的条件为. 索引为 n-1.且 arr[n-1]为1.

代码实现:

class Solution2 {
public:
    bool isOneBitCharacter(vector<int>& bits) {
        return helper(bits, 0);
    }
    bool helper(vector<int>& bits, int idx) {
        int n = bits.size();
        if (idx == n) return false;
        if (idx == n - 1) return bits[idx] == 0;
        if (bits[idx] == 0) return helper(bits, idx + 1);
        return helper(bits, idx + 2);
    }
};

---

小结

• 从问题出发.找到解决问题的步骤.