LC.P393[UTF-8编码验证]

方法一:模拟

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
class Solution {
public boolean validUtf8(int[] data) {
int n = data.length;
for (int i = 0; i < n; ) {
int t = data[i], j = 7;
while (j >= 0 && (((t >> j) & 1) == 1)) --j;
int cnt = 7 - j;
if (cnt == 1 || cnt > 4) return false;
if (i + cnt - 1 >= n) return false;
for (int k = i + 1; k < i + cnt; ++k) {
if ((((data[k] >> 7) & 1) == 1) && (((data[k] >> 6) & 1) == 0)) continue;
return false;
}
if (cnt == 0) ++i;
else i += cnt;
}
return true;
}
}
  • 时间复杂度:$O(n)$
  • 空间复杂度:$O(1)$