Given a binary array, find the maximum number of consecutive 1s in this array.
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.
public class Solution { public int findMaxConsecutiveOnes(int[] nums) { if (nums == null) return 0; int sum = 0, b = 0; for (int v : nums) { b += v; if (v == 0) b = 0; if (sum < b) sum = b; } return sum; } }
LeetCode-485. Max Consecutive Ones
原文：http://www.cnblogs.com/wxisme/p/6322341.html