485. Max Consecutive Ones

• Difficulty: Easy

• Topics: Array

• Similar Questions:

  • Max Consecutive Ones II

  • Max Consecutive Ones III

Problem:

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

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.

Note:

Solutions:

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int ret = 0;
        int count = 0;
        for (int i = 0; i < nums.size(); ++i) {
            if (nums[i] == 1) {
                ++count;
            } else {
                ret = max(ret, count);
                count = 0;
            }
        }

        ret = max(ret, count);
        return ret;
    }
};