Leetcode

Max Consecutive Ones

May 26, 2022 by aAshish

  • Time:O(n)
  • Space:O(1)

C++

 
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;
  }
};

JAVA

 
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;
  }
}

Python

 
class Solution:
  def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
    ans = 0
    sum = 0

    for num in nums:
      if num == 0:
        sum = 0
      else:
        sum += num
        ans = max(ans, sum)

    return ans