leetcode array 485

我的解法

class Solution:
def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
    n = len(nums)
    count = 0
    result = 0
    if n == 1:
        if nums[0] == 1:
            return count+1
        else:
            return count
    for i in range(n):
        if nums[i] == 1:
            count +=1
        else:
            count = 0
        if count > result:
            result = count
    return result

动态规划

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
	n = len(nums)
	        result = nums[0]
	        for i in range(1,n):
	            if nums[i] ==1 :
	                nums[i] = nums[i-1] + 1
	            else:
	                nums[i] = 0
	            result = nums[i] if nums[i] > result else result
	        return result