首页 > itarticle > algorithm notes: leetcode#485 max consecutive ones

algorithm notes: leetcode#485 max consecutive ones

admin 11月 12, 2020 0

Problem

Solution

Analysis

Python implementation

class :
    def findMaxConsecutiveOnes(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        ans = 0
        n = 0
        for num in nums:
            if num == 1:
                n += 1
            else:
                ans = max(n, ans)
                n = 0
                
        return max(n, ans)

Java implementation

class  {
    public int findMaxConsecutiveOnes(int[] nums) {
        int ans = 0;
        int n = 0;
        for(int num : nums){
            if(num == 1){
                n ++;
            }else{
                ans = ans > n ? ans : n;
                n = 0;
            }
        }
        return ans > n ? ans : n;
    }
}

Time complexity

O(N).

Space complexity

O(1).

Links

485. Max Consecutive Ones
(中文版) 算法笔记: 力扣#485 最大连续1的个数