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.

題目大體意思是如今有兩種特殊字符一個是0一個是10或者11，給一個數組，最後一位必定是0，問最後一個是否只能用0編碼

思路以下，從數組頭開始掃描，若是是1則跳過下一個由於1必定和下一個組成一個字符，若是是0則掃描下一個。

當正好落在最後一個元素時，返回true不然返回false

public boolean isOneBitCharacter(int[] bits) {
        int length = bits.length;
        int i=0;
        while(i<length)
        {
            if(i==(length-1))
            {
                return true;
            }
            if(bits[i]==1)
            {
                i+=2;
            }
            else
            {
                i++;
            }
           
        }
        return false;
    }