MaxConsecutiveOnes [source code]

public class MaxConsecutiveOnes {

  public int findMaxConsecutiveOnes(int[] nums) {
    int max = 0;
    int sum = 0;
    for (int i = 0; i<nums.length; i++) {
      if (nums[i] == 1) sum ++;
      else sum = 0;
      if (sum > max) max = sum;
    }
    return max;
  }

}

都没有做过这么简单的题。
思路反正就是很直接的，就是一个考察你对buffer的使用情况。这里稍微要想到的东西就是要想到要用两个buffer；
不过一个max + sum两个buffer一起用的情况其实见的也挺多的了；

Problem Description

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
Difficulty:Easy
Category:Algorithms
Acceptance:54.16%
Contributor: Stomach_ache
Companies
google
Related Topics
array
Similar Questions
Max Consecutive Ones II