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) {
int maxValue = 0;
int len = nums.size();
if(len <= 0) return 0;
for(int i=0;i<len;i++)
{
int temp = 0;
if(nums[i] == 1)
{
while(i<len&& nums[i] == 1)
{
++temp;
++i;
}
if(temp>maxValue)
maxValue = temp;
}
}
return maxValue;
}
};