门户网站的主要特点_秘塔猫ai写作官网_今天最新军事新闻视频_中国 日本 韩国

Problem

Given a binary array nums, return the maximum number of consecutive 1’s in the array.

Algorithm

Just count directly

Code

class Solution:def findMaxConsecutiveOnes(self, nums: List[int]) -> int:maxn, cnts = 0, 0for num in nums:if num:cnts += 1else:if maxn < cnts:maxn = cntscnts = 0if maxn < cnts:maxn = cntsreturn maxn