-
Notifications
You must be signed in to change notification settings - Fork 0
/
MaxConsecutiveOnes.java
38 lines (32 loc) · 895 Bytes
/
MaxConsecutiveOnes.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
package arrays.easy;
/***
* Problem 485 in Leetcode: https://leetcode.com/problems/max-consecutive-ones/
*
* Given a binary array nums, return the maximum number of consecutive 1's in the array.
*
* Example 1:
* Input: nums = [1,1,0,1,1,1]
* Output: 3
*
* Example 2:
* Input: nums = [1,0,1,1,0,1]
* Output: 2
*/
public class MaxConsecutiveOnes {
public static void main(String[] args) {
int[] nums = {1, 1, 0, 1, 1, 1};
System.out.println("Number of One's: " + getMaxConsecutiveOnes(nums));
}
private static int getMaxConsecutiveOnes(int[] nums) {
int maxCount = 0, count = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 0) {
count = 0;
} else {
count++;
maxCount = Math.max(count, maxCount);
}
}
return maxCount;
}
}