393UTF-8 Validation

最新推荐文章于 2020-07-04 19:17:25 发布

woibu

最新推荐文章于 2020-07-04 19:17:25 发布

阅读量387

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u012985132/article/details/52487667

版权

leetcode 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

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.

最开始的想法：遍历数组判断每一个元素是否符合要求。data[0]的开头有几个1，数目是否大于数组的长度。再一次判断后面的数组元素的第一位是否是1，第二位是否是0

结果超时。

分析数组数值的范围，先判断第一个数组元素的大小根据大小判断应该有几位。再一次判断后续的数组位是否符合要求

1-byte: [0, 127]
2-byte: [192, 223], [128, 191]
3-byte: [224, 239], [128, 191], [128, 191]
4-byte: [240, 247], [128, 191], [128, 191], [128, 191]

public class Solution {
    public boolean validUtf8(int[] data) {
        int bitCount=0;
        for(int i=0;i<data.length;i++){
            if(data[i]>=192){
                if(bitCount!=0)
                    return false;
        
                else if(data[i]>=240){
                    bitCount=3;
                }
                else if(data[i]>=224){
                    bitCount=2;
                }
                else bitCount=1;
        }
        else if(data[i]>=128){
            bitCount--;
            if(bitCount<0)
                return false;
        }
        else if(bitCount>0)
            return false;
        }
        return bitCount==0;
    }
}