摘要：題目要求檢驗(yàn)整數(shù)數(shù)組能否構(gòu)成合法的編碼的序列。剩余的字節(jié)必須以開(kāi)頭。而緊跟其后的字符必須格式為。綜上所述單字節(jié)多字節(jié)字符的跟隨字節(jié)兩個(gè)字節(jié)的起始字節(jié)三個(gè)字節(jié)的起始字節(jié)四個(gè)字節(jié)的起始字節(jié)下面分別是這題的兩種實(shí)現(xiàn)遞歸實(shí)現(xiàn)循環(huán)實(shí)現(xiàn)

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

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

檢驗(yàn)整數(shù)數(shù)組能否構(gòu)成合法的UTF8編碼的序列。UTF8的字節(jié)編碼規(guī)則如下：

每個(gè)UTF8字符包含1~4個(gè)字節(jié)

如果只包含1個(gè)字節(jié)，則該字節(jié)以0作為開(kāi)頭，剩下的位隨意

如果包含兩個(gè)或兩個(gè)以上字節(jié)，則起始字節(jié)以n個(gè)1和1個(gè)0開(kāi)頭，例如，如果該UTF8字符包含兩個(gè)字節(jié)，則第一個(gè)字節(jié)以110開(kāi)頭，同理，三個(gè)字符的第一個(gè)字節(jié)以1110開(kāi)頭。剩余的字節(jié)必須以10開(kāi)頭。

首先我們整理一下，每一種類(lèi)型的UTF8字符包含什么樣的規(guī)格：

只包含一個(gè)字節(jié)，該字節(jié)格式為0xxxxxxx，則轉(zhuǎn)換為整數(shù)的話(huà)，該整數(shù)必須小于128（1000000）

包含多個(gè)字節(jié)，則頭字節(jié)格式為110xxxxx, 1110xxxx, 11110xxx。而緊跟其后的字符必須格式為10xxxxxx。

綜上所述：

num<1000000: 單字節(jié)

10000000=

11000000<=num<11100000: 兩個(gè)字節(jié)的起始字節(jié)

11100000<=num<11110000: 三個(gè)字節(jié)的起始字節(jié)

11110000<=num<11111000: 四個(gè)字節(jié)的起始字節(jié)

下面分別是這題的兩種實(shí)現(xiàn)：

遞歸實(shí)現(xiàn)：

    private static final int ONE_BYTE = 128; //10000000
    private static final int FOLLOW_BYTE = 192; //11000000
    private static final int TWO_BYTE = 224; //11100000
    private static final int THREE_BYTE = 240;//11110000
    private static final int FOUR_BYTE = 248;//11111000
    public boolean validUtf8(int[] data) {
        return validUtf8(data, 0);
    }
    
    public boolean validUtf8(int[] data, int startAt) {
        if(startAt >= data.length) return true;
        int first = data[startAt];
        
        int followLength = 0;
        if(first < ONE_BYTE) {
            return validUtf8(data, startAt+1);
        }else if(first < FOLLOW_BYTE){
            return false;
        }else if(first  data.length) return false; 
        for(int i = 1 ; i= FOLLOW_BYTE) {
                return false;
            }
        }
        return validUtf8(data, startAt + followLength);
    }

循環(huán)實(shí)現(xiàn)：

    private static final int ONE_BYTE = 128; //10000000
    private static final int FOLLOW_BYTE = 192; //11000000
    private static final int TWO_BYTE = 224; //11100000
    private static final int THREE_BYTE = 240;//11110000
    private static final int FOUR_BYTE = 248;//11111000
    public boolean validUtf8(int[] data) {
        return validUtf8(data, 0);
    }
    
    public boolean validUtf8(int[] data, int startAt) {
        int followCount = 0;
        for(int num : data) {
            if(num < ONE_BYTE) {
                if(followCount != 0) {
                    return false;
                }
            }else if(num < FOLLOW_BYTE) {
                if(followCount == 0) {
                    return false;
                }
                followCount--;
            }else if(num < TWO_BYTE) {
                if(followCount != 0) {
                    return false;
                }
                followCount = 1;
            }else if(num < THREE_BYTE) {
                if(followCount != 0) {
                    return false;
                }
                followCount = 2;
            }else if(num < FOUR_BYTE) {
                if(followCount != 0) {
                    return false;
                }
                followCount = 3;
            }else {
                return false;
            }
        }
        return followCount == 0;
    }