485. Max Consecutive Ones

485. Max Consecutive Ones (Easy)

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

 

Example 1:

Input: nums = [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.

Example 2:

Input: nums = [1,0,1,1,0,1]
Output: 2

 

Constraints:

• 1 <= nums.length <= 105
• nums[i] is either 0 or 1.

Companies:
Amazon, Google, Facebook

Related Topics:
Array

Similar Questions:

• Max Consecutive Ones II (Medium)
• Max Consecutive Ones III (Medium)
• Consecutive Characters (Easy)
• Longer Contiguous Segments of Ones than Zeros (Easy)

Solution 1. Greedy

// OJ: https://leetcode.com/problems/max-consecutive-ones/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(1)
class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& A) {
        int ans = 0, cnt = 0;
        for (int n : A) {
            if (n) ans = max(ans, ++cnt);
            else cnt = 0;
        }
        return ans;
    }
};