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 class Solution {
 2     public int findMaxConsecutiveOnes(int[] nums) {
 3         int preMax = -1, currentMax = 0;
 4         for (int num : nums) {
 5             if (num == 1) currentMax++;
 6             else {
 7                 preMax = Math.max(preMax, currentMax);
 8                 currentMax = 0;
 9             }
10         }
11         return Math.max(preMax, currentMax);
12     }
13 }

Max Consecutive Ones

原文：http://www.cnblogs.com/amazingzoe/p/6391361.html