leetcode Day21----array.easy

最新推荐文章于 2023-02-25 23:03:36 发布

weixin_43371383

最新推荐文章于 2023-02-25 23:03:36 发布

阅读量140

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/weixin_43371383/article/details/89681461

leetcode 专栏收录该内容

33 篇文章

订阅专栏

本文探讨了一种特殊的字符编码方式，其中第一个字符由一位（0）表示，第二个字符由两位（10或11）表示。文章提供了解码这种字符串的方法，并通过实例解释了如何判断最后一个字符是否为一位字符。

1-bit and 2-bit Characters

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.

C语言

bool isOneBitCharacter(int* bits, int bitsSize){
    int count = 0, i = bitsSize==1? bitsSize-1 : bitsSize-2;
    while(i>=0 && bits[i--])    count++;
    return count&1? false:true;
}

Success
Details
Runtime: 4 ms, faster than 90.51% of C online submissions for 1-bit and 2-bit Characters.
Memory Usage: 7.3 MB, less than 100.00% of C online submissions for 1-bit and 2-bit Characters.

python3

class Solution:
    def isOneBitCharacter(self, bits: List[int]) -> bool:
        i = 0
        n = len(bits) - 1
        while i < n:
            i+= 1+bits[i]
        return i == n

Success
Details
Runtime: 36 ms, faster than 98.04% of Python3 online submissions for 1-bit and 2-bit Characters.
Memory Usage: 13.4 MB, less than 11.36% of Python3 online submissions for 1-bit and 2-bit Characters.