Leetcode 1375. 灯泡开关 III python3

时间复杂度：$O(N)$
时间复杂度：$O(1)$

class Solution:
    def numTimesAllBlue(self, light: [int]) -> int:
        if light == []:
            return 0
        # 发现没那么复杂
        length = len(light)
        res = 0
        #点亮灯泡的最大位置
        max_num = 0
        #现在点亮灯总个数
        now_sum = 0
        for i in range(length):
            if light[i] > max_num:
                max_num = light[i]
                now_sum += 1
            else:
                now_sum += 1
            if max_num == now_sum:
                res += 1
        return res