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
my answer:
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int a=0;
int b=0;
for(int i=0;i<nums.size();i++)
{
if(nums[i]==1)
{
b++;
if(b>a)
{
a=b;
}
}
if(nums[i]==0)
{
b=0;
}
}
return a;
}
};
本题注意事项:
总体来说本题偏易,并无多大的障碍。只要注意逻辑关系基本就搞定了