1-bit and 2-bit Characters LeetCode solution in Java

1
class Solution {
2
public boolean isOneBitCharacter(int[] bits) {
3
int ones = 0;
4
// Starting from one but last, as last one is always 0.
5
for (int i = bits.length - 2; i >= 0 && bits[i] != 0; i--) {
6
ones++;
7
}
8
if (ones % 2 > 0) return false;
9
return true;
10
}
11
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0