FilesExpand file tree

 master

/

MaxConsecutiveOnes.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

36 lines (34 loc) · 936 Bytes

 master

/

MaxConsecutiveOnes.java

Copy path

Top

File metadata and controls

• Code
• Blame

36 lines (34 loc) · 936 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package array;

/**

* Created by gouthamvidyapradhan on 08/05/2019 Given a binary array, find the maximum number of

* consecutive 1s in this array.

*

* <p>Example 1: Input: [1,1,0,1,1,1] Output: 3 Explanation: The first two digits or the last three

* digits are consecutive 1s. The maximum number of consecutive 1s is 3. Note:

*

* <p>The input array will only contain 0 and 1. The length of input array is a positive integer and

* will not exceed 10,000

*/

public class MaxConsecutiveOnes {

public static void main(String[] args) {

//

}

public int findMaxConsecutiveOnes(int[] nums) {

int max = 0;

boolean flag = false;

int count = 0;

for (int i = 0; i < nums.length; i++) {

if (nums[i] == 1) {

if (!flag) {

flag = true;

}

count++;

max = Math.max(max, count);

} else {

count = 0;

flag = false;

}

}

return max;

}

}