首页 > 代码库 > [leetcode-485-Max Consecutive Ones]
[leetcode-485-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 and 1.
The length of input array is a positive integer and will not exceed 10,000
思路：
遍历一遍，随时观察是否为1，不是的话从0开始。
int findMaxConsecutiveOnes(vector<int>& nums) { if (nums.size() == 0)return 0; int one = 0; int ret = 0; for (int i = 0; i < nums.size();i++) { if (nums[i] == 1) one++; else if (nums[i] == 0) { ret = max(ret, one); one = 0; } } ret = max(ret, one); return ret; }
[leetcode-485-Max Consecutive Ones]
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。