717. 1-bit and 2-bit Characters

Loading Question ...

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.

  • Seen this question in a real interview before?  
    Yes
    No
    When did you encounter this question?  
    last week
    last month
    last 3 month
    last 6 month
    more than 6 months
    other
    Which stage?  
    Online Assessment
    Phone Interview
    On Campus Interview
    Onsite Interview
    Don't know
    Which company?  
    Adobe
    Aetion
    Airbnb
    Alibaba
    Amazon
    Apple
    Baidu
    Bloomberg
    Cloudera
    Coursera
    Cryptic Studios
    Dropbox
    eBay
    Epic Systems
    Expedia
    Facebook
    Fallible
    Games
    Gilt Groupe
    GoDaddy
    Goo
    Google
    Hedvig
    Helix
    Houzz
    Hulu
    Indeed
    Intuit
    IXL
    LinkedIn
    LiveRamp
    Lyft
    MAQ Software
    Mathworks
    Microsoft
    NetEase
    Netsuite
    Palantir
    Palantir Technologies
    Pinterest
    Pocket Gems
    Poynt
    Pure
    Pure Storage
    Rackspace
    Radius
    Riot
    Riot Games
    Samsung
    Snapchat
    Square
    Storage
    Tencent
    TinyCo
    Twitter
    Two Sigma
    Uber
    Valve
    WAP
    Works Applications
    Yahoo
    Yahoo!
    Yelp
    Zappos
    Zenefits