Array：Max Consecutive Ones

标签：not   lan   span   max   blog   find   log   ret   class   

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的个数。

解体思路：

用maxHere记录当前的连续1的个数，用Math.max获得历史值中的最大值。

public int findMaxConsecutiveOnes(int[] nums) {
        int maxHere = 0, max = 0;
        for (int num : nums) {
            maxHere = num == 0 ? 0 : maxHere + 1;
            max = Math.max(max, maxHere);
        }
        return max;
    }

Array：Max Consecutive Ones

标签：not   lan   span   max   blog   find   log   ret   class   

原文地址：http://www.cnblogs.com/ltchu/p/6410954.html