485. Max Consecutive Ones

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

public class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int count1=0,max=0;
        for(Integer a:nums)
        {
            if(a==0){
                count1=0;
            }
            else{
                count1++;
                max=Math.max(count1,max);//放在这里更好
            }
            
        }
        return max;
    }