leetcode day22 longest continuous increasing subarray & 1bit and 2bits

1、longest continuous increasing subarray
题目描述：求出一个数组中，单调递增的最长的数组
题目思路：sliding window， 我的方法是，设定一个变量，当nums[i+1] <nums[i]的时候，count_cur=0,其他时候加一，然后归零的时候与count_max相比，最后返回count_max

class Solution:
    def findLengthOfLCIS(self, nums: List[int]) -> int:
        count_cur = 0
        count_max = 0
        for i in range(len(nums)):
            count_cur += 1
            count_max = count_cur if count_max<count_cur else count_max
            if i<len(nums)-1 and nums[i+1] <= nums[i]:
                count_cur = 0
        return count_max
                
        

2、题目描述：只有两种编码方式，第一种是1bit的0，第二种是2bits的10和11，给一个数组，对其编码，看是否最后一个character为1bit的
题目思路：遍历，当当前元素是1，则i+2,r=False，否则i+1,r=true

class Solution:
    def isOneBitCharacter(self, bits: List[int]) -> bool:
        r_bool = False
        i = 0
        while i<len(bits):
            if bits[i] == 1:
                r_bool = False
                i += 2
            else:
                i += 1
                r_bool = True
        return bool(i) if len(bits)==1 else r_bool