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

大致意思是求连续1的个数

 public int findMaxConsecutiveOnes(int[] nums) {
        int max = 0;
        int tempMax = 0;
        for(int n:nums)
        {
            if(n==1)
            {
                tempMax++;
                max = max>tempMax?max:tempMax;
            }
            else
            {
                tempMax = 0;
            }
        }
        return max;
    }