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.

LeetCode Problem - 711

class Solution {
    // Method to determine if the last character is a one-bit character
    public boolean isOneBitCharacter(int[] bits) {
        // Initialize an index variable
        int i = 0;

        // Traverse through the bits array
        while (i < bits.length) {
            // If the current bit is 0 and it's the last bit, return true
            if (bits[i] == 0 && i == (bits.length - 1))
                return true;

            // If the current bit is 1, skip the next bit
            if (bits[i] == 1)
                i += 2;
            // Otherwise, move to the next bit
            else
                i += 1;
        }

        // If traversal completes without encountering the last bit, return false
        return false;
    }
}