Leetcode#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. “10”和”11”为two-bit
2. “0”为one-bit

现在由以上两种组成的一个数组，判断组成数组的最后一个是不是one-bit,如果是输出“true”,否则输出”false”.

Python语言

class Solution(object):
    def isOneBitCharacter(self, bits):
        """
        :type bits: List[int]
        :rtype: bool
        """

        i = 0
        while i<len(bits):
            if bits[i] == 0:
                step = 1
                i = i + 1
            else:
                step = 2
                i = i + 2
            print step


        if step == 1:
            return True
        else:
            return False

C++语言

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