[Leetcode] 485. Max Consecutive Ones

最新推荐文章于 2024-12-07 07:15:00 发布

ApRiLLLLLLLLLLLL

最新推荐文章于 2024-12-07 07:15:00 发布

阅读量224

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/ApRiLLLLLLLLLLLL/article/details/81285617

Leetcode 专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一种通过遍历数组并记录最长连续1序列的方法。该算法针对输入的二进制数组，查找并返回最大数量的连续1。通过具体实例展示了如何实现这一功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

class Solution {
public int findMaxConsecutiveOnes(int[] nums) {
int count = 0;
int i = 0;
while (i < nums.length) {
if (nums[i] == 1) {
int temp = 1;
for (int j = 1; j < nums.length-i; j++) {

if (nums[i+j] == 1) {
temp++;
}else{
break;
}

}
if (temp > count)
count = temp;
}
i++;
}
return count;
}
}