[LeetCode]485. Max Consecutive Ones 解题报告(C++)

桑来93

于 2018-08-02 10:12:15 发布

阅读量218

点赞数

CC 4.0 BY-SA版权

分类专栏： [解题报告]

本文链接：https://blog.youkuaiyun.com/qjh5606/article/details/81353621

[解题报告] 专栏收录该内容

63 篇文章

订阅专栏

本文针对LeetCode上的485.MaxConsecutiveOnes题目提供了一种高效的C++解决方案。该算法通过一次遍历数组来找出二进制数组中连续1的最大数量。

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

[LeetCode]485. Max Consecutive Ones 解题报告(C++)

题目描述

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

题目大意

给定一个二进制的数组,找到连续1出现的最大次数

解题思路

遍历数组.
遇到1,cnt++.遇到0,则需要重置cnt.
每次更新 res

代码实现:

int findMaxConsecutiveOnes(vector<int>& nums) {

    int result = 0;
    int tmp = 0;
    for (auto x : nums) {
        if (x == 1) {
            tmp += 1;
        }
        else {
            tmp = 0;
        }
        if (tmp > result) {
            result = tmp;
        }
        // result = max(reslut,tmp);
    }
    return result;

}