485. Max Consecutive Ones

1. Description

Given a binary array, find the maximum number of consecutive 1s in this array.

2. Example

Example 1

Input: [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.

3. Note

• The input array will only contain 0 and 1.
• The length of input array is a positive integer and will not exceed 10,000

4. Solutions

Array

n = i_nums.size()
Time complexity: O(n)
Space complexity: O(1)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17

class Solution
{
public:
    // int findMaxConsecutiveOnes(vector<int>& nums)
    int findMaxConsecutiveOnes(vector<int> &i_nums)
    {
        int result = 0;
        for(int i = 0, count = 0; i < i_nums.size(); i++)
        {
            count = (i_nums[i] == 1 ? count + 1 : 0);

            result = max(result, count);
        }

        return result;
    }
};