[LeetCode] 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子串的最大长度。

思路

class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int maxlen = 0;
        int curlen = 0;
        for(int num:nums){
            if(num == 1){
                if(++curlen > maxlen)
                    maxlen = curlen;
            }
            else
                curlen = 0;
        }
        return maxlen;
    }
}