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
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int max = 0;
int curr = 0;
for (int i = 0; i < nums.size(); ++i)
{
if (nums[i] == 1) {
curr++;
} else {
if (max < curr)
max = curr;
curr = 0;
}
}
return max > curr ? max : curr;
}
};
你需要遍历一遍才知道最大连续值,如果你连这题都做不出来,你有两条路可以走,第一是别当程序员了,第二是做程序员鼓励师。