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
and1
. - The length of input array is a positive integer and will not exceed 10,000
题目大意:
给定一个二进制数组,即数组中只有0和1。求最长的连续的1有几个。
这里我们用变量cur表示当前的最长长度,ans表示最终的最长长度。遍历数组,如果是元素1,则增加当前的最长长度,如果是0,则更新最终最长长度,并且把当前长度置为0,重新开始统计。
题目代码:
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int ans = 0;
int cur = 0;
for(int i = 0; i < nums.size(); i++){
if(nums[i] == 0)
cur = 0;
else{
cur++;
ans = max(ans,cur);
}
}
return ans;
}
};