//url:https://leetcode.com/problems/max-consecutive-ones/description/
class Solution {
public:
int findMaxConsecutiveOnes(vector& nums) {
int maxCon=0;
int curMax=0;
for(int i=0;icurMax?maxCon:curMax;
}else{
curMax=0;
}
}
return maxCon;
}
};
- 本文作者: royalchen
- 本文链接: http://www.royalchen.com/2018/08/06/leetcode-485-max-consecutive-ones/
- 版权声明: 本博客所有文章除特别声明外,均采用 MIT 许可协议。转载请注明出处!