p485

LeetCode p485 Max Consecutive Ones 题解

1.题目:

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

题意:

给一个数组,里面只有0,1.求最长连续的1有多少个。

2.解题思路:

见代码

3.代码


[title] [] [url] [link text]
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
public class Solution {

public int findMaxConsecutiveOnes(int[] nums) {
int sum = 0;
int ans = 0;
for (int i = 0; i < nums.length; i++) {

if (nums[i] == 1) {
sum++;
ans = Math.max(sum, ans);
} else {
sum = 0;
}
// System.out.println(sum);
}
return ans;
}
}

4.一些总结: