717. 1-bit and 2-bit Characters

[zwfang]

https://leetcode.com/problems/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.

Note:
1 <= len(bits) <= 1000.
bits[i] is always 0 or 1.

[codecov]

Codecov Report

Merging #23 into master will increase coverage by 0.02%.
The diff coverage is 100%.

@@            Coverage Diff             @@
##           master      #23      +/-   ##
==========================================
+ Coverage   99.11%   99.12%   +0.02%     
==========================================
  Files          63       64       +1     
  Lines        1115     1129      +14     
==========================================
+ Hits         1105     1119      +14     
  Misses          6        6              
  Partials        4        4

Impacted Files	Coverage Δ
...rc/0717_1_bit_and_2_bit_characters/1bitand2bitc.go	100% <100%> (ø)