傻兮兮地每个都判断一次
class Solution(object):
def numTimesAllBlue(self, light):
"""
:type light: List[int]
:rtype: int
"""
# 就是判断某个时刻k,light[0:k+1]是否包含了[1:k+1]
count=0
for i in range(len(light)):
flag=0
for j in range(i+1):
if j+1 not in light[0:i+1]:
flag=1
break
if flag==0:
count+=1
return count
结果超出了时间限制,看到别人的题解直接判断最大值有没有包含进去,觉得自己智商真的不高
class Solution(object):
def numTimesAllBlue(self, light):
"""
:type light: List[int]
:rtype: int
"""
# 就是判断某个时刻k,light[0:k+1]的最大值是否是k+1
count=0
for i in range(len(light)):
lightmax=i+1
if lightmax==max(light[0:i+1]):
count+=1
return count
又是超出了时间限制,没必要每次都判断light[0:i+1],维护一个当前的最大值
class Solution(object):
def numTimesAllBlue(self, light):
"""
:type light: List[int]
:rtype: int
"""
# 就是判断某个时刻k,light[0:k+1]的最大值是否是k+1
count=0
lightmax=0
for i in range(len(light)):
lightmax=max(lightmax,light[i])
if lightmax==i+1:
count+=1
return count
有的大佬想到如果恰好全部亮起,那么灯泡的编号之和恰好是1+2+…+k,这个时候要用long来存
class Solution(object):
def numTimesAllBlue(self, light):
"""
:type light: List[int]
:rtype: int
"""
# 就是判断某个时刻k,light[0:k+1]的最大值是否是k+1
count=0
sum=0
for i in range(len(light)):
sum=sum+light[i]
if sum==(i+1)*(i+2)/2:
count+=1
return count