Skip to content
Programming101
Programming101

Learn everything about programming

  • Home
  • CS Subjects
    • IoT – Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programming101
Programming101

Learn everything about programming

Leetcode Max Consecutive Ones problem solution

YASH PAL, 31 July 2024

In this Leetcode Max Consecutive Ones problem solution Given a binary array nums, return the maximum number of consecutive 1’s in the array.

Leetcode Max Consecutive Ones problem solution

Problem solution in Python.

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        max1 = 0
        count = 0
        for i in range(len(nums)):
            if nums[i] == 1:
                count += 1
            if nums[i] == 0 or i+1 == len(nums):
                max1 = max (max1, int(count))
                count = 0
        return max1

Problem solution in Java.

public int findMaxConsecutiveOnes(int[] nums) {
        if(nums.length == 0) return 0;
        int max = 0, begin = -1, i = 0;
        for(i = 0; i < nums.length; i++) {
            if(nums[i] == 1) {
                if(begin == -1) begin = i;
            } else {
                if(begin != -1) max = Math.max(max, i - begin);
                begin = -1;
            }
        }
        if(begin != -1) max = Math.max(max, i - begin);
        return max;
    }

Problem solution in C++.

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int rs = 0, cur = 0;
        for(auto n:nums){
            if(!n){
                rs = max(cur, rs);
                cur = 0;
            }
            else{
                cur++;
            }
        }
        rs = max(cur, rs);
        return rs;
    }
};

Problem solution in C.

int findMaxConsecutiveOnes(int* nums, int numsSize)
{

   int i;
   int count1 = 0;
   int count2 = 0;
   int flag = 0;
   printf("*******n");
   printf("%dn", numsSize);
   for(i=0;i<numsSize;i++)
   {
        if(nums[i]==1)
        {
            count1++;
        }
        else
        {
            if(count1>count2)
            {
                count2 = count1;
                count1 = 0;
            }
        }
   }
   return count2>count1?count2:count1;
}

coding problems

Post navigation

Previous post
Next post
  • HackerRank Separate the Numbers solution
  • How AI Is Revolutionizing Personalized Learning in Schools
  • GTA 5 is the Game of the Year for 2024 and 2025
  • Hackerrank Day 5 loops 30 days of code solution
  • Hackerrank Day 6 Lets Review 30 days of code solution
How to download udemy paid courses for free

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
©2025 Programming101 | WordPress Theme by SuperbThemes