LeetCode_485. Max Consecutive Ones

 

485. Max Consecutive Ones

Easy

Given a binary array, find the maximum number of consecutive 1s in this array.

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:

• The input array will only contain 0 and 1.
• The length of input array is a positive integer and will not exceed 10,000

 

package leetcode.easy;

public class MaxConsecutiveOnes {
	public int findMaxConsecutiveOnes(int[] nums) {
		int max = 0;
		int curr_max = 0;

		for (int i = 0; i < nums.length; i++) {
			if (nums[i] == 1) {
				curr_max++;
				if (curr_max > max) {
					max = curr_max;
				}
			} else {
				curr_max = 0;
			}
		}
		return max;
	}

	@org.junit.Test
	public void test() {
		System.out.println(findMaxConsecutiveOnes(new int[] { 1, 1, 0, 1, 1, 1 }));
	}
}

 

来源：https://www.cnblogs.com/denggelin/p/12037990.html