1的最大连续数 Max Consecutive Ones

最新推荐文章于 2024-02-17 21:17:42 发布

转载最新推荐文章于 2024-02-17 21:17:42 发布 · 96 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://my.oschina.net/liyurong/blog/908149

为什么80%的码农都做不了架构师？>>>

问题：

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

解决：

①暴力解决：使用一个计数器，一个max用于保存最大连续数，9ms

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