leetcode 485. Max Consecutive Ones

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:

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

本题很简单，就是做一个遍历

代码如下：

#include <iostream>#include <vector>#include <map>#include <set>#include <queue>#include <stack>#include <string>#include <climits>#include <algorithm>#include <sstream>#include <functional>#include <bitset>#include <cmath>using namespace std;class Solution {public:    int findMaxConsecutiveOnes(vector<int>& nums)     {        int maxLen = 0 , len = 0;        for (int i = 0; i < nums.size(); i++)        {            if (nums[i] == 0 )            {                maxLen = max(maxLen, len);                len = 0;            }            else                len++;        }        maxLen = max(maxLen, len);        return maxLen;    }};