LeetCode Solutions
485. Max Consecutive Ones
Time: $O(n)$ Space: $O(1)$
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int ans = 0;
int sum = 0;
for (const int num : nums)
if (num == 1)
ans = max(ans, ++sum);
else
sum = 0;
return ans;
}
};
class Solution {
public int findMaxConsecutiveOnes(int[] nums) {
int ans = 0;
int sum = 0;
for (final int num : nums)
if (num == 1)
ans = Math.max(ans, ++sum);
else
sum = 0;
return ans;
}
}
class Solution:
def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
ans = 0
summ = 0
for num in nums:
if num == 0:
summ = 0
else:
summ += num
ans = max(ans, summ)
return ans