Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add MaxConsecutiveOnes.java to Programs list #167

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
40 changes: 40 additions & 0 deletions Programs/MaxConsecutiveOnes.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
class MaxConsecutiveOnes {
public int findMaxConsecutiveOnes(int[] nums) {
//To store the result
int max = 0;

//StartCount when 0 is found as 0
int maxCount = 0;

//Flag to check, first one is encountered or not
boolean foundOne = false;

//Iterate each element
for(int i:nums){
if(i==1){
if(!foundOne)
{
foundOne = !foundOne;
maxCount = 1;
}
else
{
maxCount ++;
}
}
else
{
//Increase if found the max consecutive of 1 so far
max = maxCount>max?maxCount:max;

//Reset flag as false, since at this place we have encountered 0,
// reset maxCount as 0, since we need to again look for the next bigger consecutive 1
foundOne = false;
maxCount = 0;
}
}
//Check at the end if any bigger consecutive 1 is found ( and 0 is not encountered at the end)
max = maxCount>max?maxCount:max;
return max;
}
}