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

Input: [1,1,0,1,1,1]Output: 3Explanation: 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

解答

1
2
3
4
5
6
7
8
9
10
11
12
13
14

public class Solution {
	public int findMaxConsecutiveOnes(int[] nums) {
		int max = 0, temp = 0;
		for (int i : nums) {
			if (i == 1) {
				temp++;
			} else {
				temp = 0;
			}
			max = Math.max(max, temp);
		}
		return max;
	}
}