1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
| class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int maxSofar = 0;
int maxCur = 0;
for(auto& num : nums)
{
if(num == 1)
{
++maxCur;
maxSofar = max(maxCur, maxSofar);
}
else
maxCur = 0;
}
return maxSofar;
}
};
|