LeetCode: 485 Max Consecutive Ones(easy)

本文介绍了一种在二进制数组中查找最长连续1序列的方法。通过遍历数组,使用计数器跟踪当前连续1的数量,并更新最大连续1的记录。此算法适用于仅包含0和1的输入数组,长度为正整数且不超过10,000。

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

题目:

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(vector<int>& nums) {
        int count = 0, max = 0;
        for (int i = 0; i < nums.size(); i++) {
            if (nums[i] == 1 && (!i || nums[i - 1] != 1)) count = 1;
            else if (i && nums[i] == 1 && nums[i - 1] == 1) count++;
            if (max < count) max = count;
        }
        if (max < count) max = count;
        return max;
    }
};

自己的:

class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        int result = 0;
        int tem = 0;
        nums.push_back(0);
        for (auto c : nums){
            if(c == 0){
                if ( tem > result)
                    result = tem;
                tem = 0;
            }
            else
                tem++;
        }
        return result;
    }
};

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值