-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathOnebitandTwobitCharacters.java
More file actions
45 lines (42 loc) · 1.28 KB
/
OnebitandTwobitCharacters.java
File metadata and controls
45 lines (42 loc) · 1.28 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
package easy;
/**
* ClassName: OnebitandTwobitCharacters.java
* Author: chenyiAlone
* Create Time: 2019/12/10 20:40
* Description: No.717 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.
*
* 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.
*
*/
public class OnebitandTwobitCharacters {
public boolean isOneBitCharacter(int[] bits) {
for (int i = 0; i < bits.length; ) {
if (bits[i] == 0) i++;
else if (bits[i] == 1 && i < bits.length - 2)
i += 2;
else
return false;
}
return true;
}
}