今天的平易近人多了
唉
一二三四五
這幾天寫到想去s
def longestSubarray(self, nums: List[int]) -> int:
maximum = max(nums)
rets = 0
cur_len = 0
for num in nums:
if num==maximum:
cur_len += 1
else:
cur_len = 0
rets = max(rets, cur_len)
return rets

大師