JuniorArray

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).

Given a binary array bits that ends with 0, return true if the last character must be a one-bit character.

Example 1
Inputbits = [1,0,0]
Outputtrue
The only way to decode it is a two-bit character followed by a one-bit character, so the last character is a one-bit character.
Example 2
Inputbits = [1,1,1,0]
Outputfalse
The only way to decode it is two two-bit characters, so the last character is not a one-bit character.

Constraints

  • 1 <= bits.length <= 1000
  • bits[i] is either 0 or 1.

Asked at 4 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate