LeetCode 485. Max Consecutive Ones
2017-04-07 13:33
507 查看
class Solution { public: int findMaxConsecutiveOnes(vector<int>& nums) { int maxNum=0; //一定要初始化 for(int i=0; i<nums.size(); i++){ int cstvCnt=0; if(nums[i]==1){ //如果找到1,则开始比较接下来的元素 cstvCnt++; i++; while(i<nums.size() && nums[i]!=0){ //下一个元素不等于0,且i还没到最后,cstvCnt继续加,i继续加 cstvCnt++; i++; } if(maxNum<cstvCnt){ //比较最新的统计连续1数量和原来的最大数量 maxNum=cstvCnt; } } } return maxNum; } };
相关文章推荐
- LeetCode 485. Max Consecutive Ones
- LeetCode 485. Max Consecutive Ones
- [leetcode]: 485. Max Consecutive Ones
- [leetcode: Python]485. Max Consecutive Ones
- leetcode 485. Max Consecutive Ones python
- LeetCode 485. Max Consecutive Ones (最长连续1)
- LeetCode 485. Max Consecutive Ones
- LeetCode-485. Max Consecutive Ones
- 【算法作业1】LeetCode 485. Max Consecutive Ones
- leetcode-485. Max Consecutive Ones
- leetcode 485. Max Consecutive Ones
- LeetCode -485. Max Consecutive Ones - 思路详解 - C++
- leetcode--485. Max Consecutive Ones
- Leetcode 485. Max Consecutive Ones
- LeetCode-485. Max Consecutive Ones
- Leetcode 485. Max Consecutive Ones
- LeetCode_485. Max Consecutive Ones
- leetcode 485. Max Consecutive Ones
- 485. Max Consecutive Ones leetcode array
- 【LeetCode】485. Max Consecutive Ones