LWC 56:717. 1-bit and 2-bit Characters

LWC 56:717. 1-bit and 2-bit Characters

传送门:717. 1-bit and 2-bit Characters

Problem:

We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11). Now given a string represented by several bits. Return whether the last character must be a one-bit character or not. The given string will always end with a zero.

Example 1:

Input: bits = [1, 0, 0] Output: True Explanation: The only way to decode it is two-bit character and one-bit character. So the last character is one-bit character.

Example 2:

Input: bits = [1, 1, 1, 0] Output: False Explanation: The only way to decode it is two-bit character and two-bit character. So the last character is NOT one-bit character.

Note:

1 <= len(bits) <= 1000.

bits[i] is always 0 or 1.

思路: 如果遇到1,则可以把连带的[1,1]或者[1,0]取出来,如果遇到0,则只需要取一位,所以取到第n-2位,那么必然最后剩下一位或者零位,剩下一位返回true,剩下零位返回false.

代码如下:

    public boolean isOneBitCharacter(int[] bits) {
        int n = bits.length;
        int i = 0;
        for (; i < n - 1;) {
            if (bits[i] == 1) {
                i += 2;
            }
            else {
                i += 1;
            }
        }
        return i == n - 1;
    }   

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏静默虚空的博客

单链表的算法

要点 在顺序表的算法文章中,我们讨论了线性表的顺序存储结构——顺序表。 顺序表是用一组地址连续的存储单元来保存数据的,所以它具有随机存取的特点。即查找快速,但是...

1799
来自专栏算法修养

CodeForces 17E Palisection(回文树)

E. Palisection time limit per test 2 seconds memory limit per test 128 meg...

3214
来自专栏LeetCode

LeetCode <dp>152&628 Maximum Product Subarray

Given an integer array nums, find the contiguous subarray within an array (conta...

1064
来自专栏小樱的经验随笔

Codeforces 719B Anatoly and Cockroaches

B. Anatoly and Cockroaches time limit per test:1 second memory limit per test:25...

2736
来自专栏wym

Codeforces Round #483 (Div. 2) A. Game

Initially there are nn integers a1,a2,…,ana1,a2,…,an written on the board. Each ...

872
来自专栏数据结构与算法

1230 元素查找

1230 元素查找 时间限制: 1 s 空间限制: 128000 KB 题目等级 : 钻石 Diamond 题目描述 Description 给出...

1853
来自专栏数据结构与算法

BZOJ3585: mex(主席树)

Description   有一个长度为n的数组{a1,a2,...,an}。m次询问,每次询问一个区间内最小没有出现过的自然数。 Input   第一行n,m...

4049
来自专栏Bingo的深度学习杂货店

Q70 Climbing Stairs

You are climbing a stair case. It takes n steps to reach to the top. Each time y...

3335
来自专栏xingoo, 一个梦想做发明家的程序员

Floyd

另一个求解最短路径的经典算法是Floyd,时间复杂度为O(n^3),所以如果只求一个点到另一个点的最短路径,应该用Dijkstra算法,时间复杂度为O(n^2)...

2007
来自专栏机器学习入门

LWC 56:443. String Compression

LWC 56:443. String Compression 传送门:443. String Compression Problem: Given an ar...

1908

扫码关注云+社区