# 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

class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int res = 0, cnt = 0;
for (int num : nums) {
cnt = (num == 0) ? 0 : cnt + 1;
res = max(res, cnt);
}
return res;
}
};

class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int res = 0, sum = 0;
for (int num : nums) {
sum = (sum + num) * num;
res = max(res, sum);
}
return res;
}
};

Github 同步地址：

https://github.com/grandyang/leetcode/issues/485

Max Consecutive Ones II

Max Consecutive Ones III

https://leetcode.com/problems/max-consecutive-ones/

https://leetcode.com/problems/max-consecutive-ones/discuss/96693/Java-4-lines-concise-solution-with-explanation

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation