验证给定数组中数字的二进制表示是否符合UTF-8编码 UTF-8 Validation

为什么80%的码农都做不了架构师？>>>   

问题：

A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:

1. For 1-byte character, the first bit is a 0, followed by its unicode code.
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:

   Char. number range  |        UTF-8 octet sequence
      (hexadecimal)    |              (binary)
   --------------------+---------------------------------------------
   0000 0000-0000 007F | 0xxxxxxx
   0000 0080-0000 07FF | 110xxxxx 10xxxxxx
   0000 0800-0000 FFFF | 1110xxxx 10xxxxxx 10xxxxxx
   0001 0000-0010 FFFF | 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx

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:

data = [197, 130, 1], which represents the octet sequence: 11000101 10000010 00000001.
Return true.
It is a valid utf-8 encoding for a 2-bytes character followed by a 1-byte character.

Example 2:

data = [235, 140, 4], which represented the octet sequence: 11101011 10001100 00000100.
Return false.
The first 3 bits are all one's and the 4th bit is 0 means it is a 3-bytes character.
The next byte is a continuation byte which starts with 10 and that's correct.
But the second continuation byte does not start with 10, so it is invalid.

解决：

① 直接判断，分情况讨论。

class Solution { //6ms
    public boolean validUtf8(int[] data) {
        int count = 0;//标记有几个字符
        for (int num : data){
            if (count == 0){
                if ((num & 0x80) == 0){
                    count = 0;
                }else if ((num & 0xe0) == 0xc0){
                    count = 1;
                }else if ((num & 0xf0) == 0xe0){
                    count = 2;
                }else if ((num & 0xf8) == 0xf0){
                    count = 3;
                }else {
                    return false;
                }
            }else {
                if ((num & 0xc0) != 0x80) return false;
                count --;
            }
        }
        return count == 0;
    }
}

转载于:https://my.oschina.net/liyurong/blog/1600855