[LintCode] UTF-8 Validation

tolerious 发布于2019-08-19 10:57 / 1666人阅读

Problem

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 (hexadecimal)	UTF-8 octet sequence (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

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.

Solution

class Solution {
    public boolean validUtf8(int[] data) {
        if (data == null || data.length == 0) return false;
        for (int i = 0; i < data.length; i++) {
            if (data[i] > 255) return false;
            int count = 0;
            if (data[i] < 128) {
                count = 1;
            } else if (data[i] >= 192 && data[i] < 224) {
                count = 2;
            } else if (data[i] < 240) {
                count = 3;
            } else if (data[i] < 248) {
                count = 4;
            } else {
                return false;
            }
            
            for (int j = 1; j < count; j++) {
                if (i+j >= data.length) return false;
                if (data[i+j] < 128 || data[i+j] >= 192) return false;
            }
            
            i = i+count-1;
        }
        return true;
    }
}

GPU云服务器云服务器 LintCode Validation LintCode134_LRU jquery validation

文章版权归作者所有，未经允许请勿转载,若此文章存在违规行为，您可以联系管理员删除。

转载请注明本文地址：https://www.ucloud.cn/yun/76740.html

UTF-8 Validation

摘要：题目链接这道题关键是搞懂题目意思。思路及代码知道意思之后，这道题就很简单了。一个，每次分三步来做，是每次都是新的统计后位里面，从前开始有多少个，用变量来保存，其中可能的值只有从开始检查，后八位中的前两位是否为，一共检查更新的值为 UTF-8 Validation 题目链接：https://leetcode.com/problems... 这道题关键是搞懂题目意思。 UTF-8 1 by...

Kahn 2019-08-14 17:18 评论0 收藏0
leetcode393. UTF-8 Validation

摘要：题目要求检验整数数组能否构成合法的编码的序列。剩余的字节必须以开头。而紧跟其后的字符必须格式为。综上所述单字节多字节字符的跟随字节两个字节的起始字节三个字节的起始字节四个字节的起始字节下面分别是这题的两种实现递归实现循环实现题目要求 A character in UTF8 can be from 1 to 4 bytes long, subjected to the followin...

Cruise_Chan 2019-08-16 15:07 评论0 收藏0
记录_使用JSR303规范进行数据校验

摘要：时间年月日星期三说明使用规范校验接口请求参数源码第一章理论简介背景介绍如今互联网项目都采用接口形式进行开发。该规范定义了一个元数据模型，默认的元数据来源是注解。时间：2017年11月08日星期三说明：使用JSR303规范校验http接口请求参数源码：https://github.com/zccodere/s... 第一章：理论简介 1-1 背景介绍如今互联网项目都采用HTTP接口...

187J3X1 2019-08-15 12:28 评论0 收藏0
Bean Validation完结篇：你必须关注的边边角角（约束级联、自定义约束、自定义校验器、国际

摘要：和上标注的约束都会被执行注意如果子类覆盖了父类的方法，那么子类和父类的约束都会被校验。每篇一句没有任何技术方案会是一种银弹，任何东西都是有利弊的相关阅读【小家Java】深入了解数据校验：Java Bean Validation 2.0（JSR303、JSR349、JSR380）Hibernate-Validation 6.x使用案例【小家Spring】Spring方法级别数据校...

niuxiaowei111 2019-08-19 10:17 评论0 收藏0
eclipse定制化配置调优、初始化配置指南、可以解决启动慢等问题

摘要：配置的参数打开根目录下的在最后面加上如下的参数测试环境位内存双核测试版本经测试，启动速度比默认配置有所提升，占用内存也较少其中这三行为启用方式，不能保证在不同环境下都是最优配置，可以替换为多核和大内存建议使配置eclipse的jvm参数打开eclipse根目录下的eclipse.ini在最后面加上如下的jvm参数 -Xms400m -Xmx1400m -XX:NewSize=128...

Warren 2019-08-14 15:16 评论0 收藏0