Leetcode 485 Max Consecutive Ones
#include <vector>
using namespace std;
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int count = 0;
int max = 0;
for (int i = 0; i < nums.size(); i++){
if (nums[i])
count++;
else{
if (count > max)
max = count;
count = 0;
}
}
return max > count ?max : count;//得考虑没有0的情况
}
};