Solving 1 bit and 2 bit Characters in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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.

  • 1 <= len(bits) <= 1000.

See the full details of the problem 1 bit and 2 bit Characters at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go