393 UTF-8 Validation

# 1. Question

A character in UTF8 can be from1 to 4 bytes long, subjected to the following rules:
1. 1.
For 1-byte character, the first bit is a 0, followed by its unicode code.
2. 2.
For n-bytes character, the first n-bits are all one's, the n+1 bit is 0, followed by n-1 bytes with most significant 2 bits being 10.
This is how the UTF-8 encoding would work:
1
Char. number range | UTF-8 octet sequence
2
3
--------------------+---------------------------------------------
4
0000 0000-0000 007F | 0xxxxxxx
5
0000 0080-0000 07FF | 110xxxxx 10xxxxxx
6
0000 0800-0000 FFFF | 1110xxxx 10xxxxxx 10xxxxxx
7
0001 0000-0010 FFFF | 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
Copied!
Given an array of integers representing the data, return whether it is a valid utf-8 encoding.
Note: The input is an array of integers. Only the least significant 8 bits of each integer is used to store the data. This means each integer represents only 1 byte of data.
Example 1:
1
data = [197, 130, 1], which represents the octet sequence: 11000101 10000010 00000001.
2
3
Return true.
4
It is a valid utf-8 encoding for a 2-bytes character followed by a 1-byte character.
Copied!
Example 2:
1
data = [235, 140, 4], which represented the octet sequence: 11101011 10001100 00000100.
2
3
Return false.
4
The first 3 bits are all one's and the 4th bit is 0 means it is a 3-bytes character.
5
The next byte is a continuation byte which starts with 10 and that's correct.
6
But the second continuation byte does not start with 10, so it is invalid.
Copied!

# 2. Implementation

(1) Bit Manipulation

1
class Solution {
2
public boolean validUtf8(int[] data) {
3
int count = 0;
4
5
for (int oneByte : data) {
6
if (count == 0) {
7
if ((oneByte >> 3) == 0b11110) {
8
count = 3;
9
}
10
else if ((oneByte >> 4) == 0b1110) {
11
count = 2;
12
}
13
else if ((oneByte >> 5) == 0b110) {
14
count = 1;
15
}
16
else if ((oneByte >> 7) == 0b1) {
17
return false;
18
}
19
}
20
else {
21
if ((oneByte >> 6) == 0b10) {
22
--count;
23
}
24
else {
25
return false;
26
}
27
}
28
}
29
return count == 0;
30
}
31
}
Copied!

# 3. Time & Space Complexity

Bit Manipulation: 时间复杂度O(N), 空间复杂度O(1)