717. 1-bit and 2-bit Characters--Python

本文介绍了一种算法,用于识别由1-bit和2-bit字符组成的字符串,并判断最后一个字符是否为1-bit字符。通过循环读取并解析输入的比特串,最终确定字符串的有效性。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

717. 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.

思路:
先进行一个循环,检测是不是00或者是10,11三种情况中的一种,是的话直接删除这两位,否则(就是为01的情况)就只删除第一位0,再次读取前两位,用while来完成只读前两位的工作,然后最后长度只有2以后再判断(第一版没有考虑到[0,0]的情况,只按最后输出长度是1还是0来返回,出错了,所以改为最后长度为2时就跳出while循环。)
注:我这个答案虽然可以通过但是效率不高,还有值得改进的地方!

代码:

class Solution:
    def isOneBitCharacter(self, bits):
        """
        :type bits: List[int]
        :rtype: bool
        """
#        if len(bits)==0:
#            return False
#        while len(bits)>1:
#            if bits[0:2]==[0,0] or bits[0:2]==[1,0] or bits[0:2]==[1,1]:
#                del bits[0:2]
#            else:
#                del bits[0]
#        if len(bits) == 1:
#            return True
#        if len(bits) == 0:
#            return False

        while len(bits)>2:
            if bits[0:2]==[0,0] or bits[0:2]==[1,0] or bits[0:2]==[1,1]:
                del bits[0:2]
            else:
                del bits[0]
        if len(bits) == 1:
            return True
        if len(bits) == 2:
            if bits[0]==1return False
            else:
                return True
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值