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
and1
. - The length of input array is a positive integer and will not exceed 10,000
题意:给一个二进制数组,求出连续1的个数最大为多少。
直接上代码:
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
vector<int> sum;
int n=nums.size();
int cnt=0;
for(int i=0;i<n;i++)
{
if(nums[i]==1)
{
cnt++;
}
else
{
sum.push_back(cnt);
cnt=0;
}
}
sum.push_back(cnt);
int max=-1;
for(int i=0;i<sum.size();i++)
{
if(max<=sum[i])
max=sum[i];
}
return max;
}
};