-
Notifications
You must be signed in to change notification settings - Fork 35
Expand file tree
/
Copy pathutf-8-validation.java
More file actions
48 lines (42 loc) · 1.78 KB
/
utf-8-validation.java
File metadata and controls
48 lines (42 loc) · 1.78 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
46
47
48
/*Question:-Given an integer array data representing the data, return whether it is a valid UTF-8 encoding (i.e. it translates to a sequence of valid UTF-8 encoded characters).
A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:
For a 1-byte character, the first bit is a 0, followed by its Unicode code.
For an n-bytes character, the first n bits are all one's, the n + 1 bit is 0, followed by n - 1 bytes with the most significant 2 bits being 10.
This is how the UTF-8 encoding would work:
Number of Bytes | UTF-8 Octet Sequence
| (binary)
--------------------+-----------------------------------------
1 | 0xxxxxxx
2 | 110xxxxx 10xxxxxx
3 | 1110xxxx 10xxxxxx 10xxxxxx
4 | 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
x denotes a bit in the binary form of a byte that may be either 0 or 1.*/
//Solution
class Solution {
public boolean validUtf8(int[] data) {
int count = 0;
for (int value : data) {
if (count == 0) {
if (value >> 3 == 0b11110) {
count = 3;
} else if (value >> 4 == 0b1110) {
count = 2;
} else if (value >> 5 == 0b110) {
count = 1;
} else if (value >> 7 == 0b0) {
count = 0;
} else {
return false;
}
} else {
if (value >> 6 == 0b10) {
count--;
} else {
return false;
}
}
}
return count == 0;
}
}
//Submission link:-https://leetcode.com/submissions/detail/798949428/