leetcode.485. Max Consecutive Ones

最新推荐文章于 2025-08-14 22:07:01 发布

yanming515

最新推荐文章于 2025-08-14 22:07:01 发布

阅读量199

点赞数

分类专栏： c 文章标签： algorithm leetcode

c 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一种高效算法，用于解决给定二进制数组中寻找最大数量连续1的问题。通过两个示例解决方案展示了不同实现方式，包括一种简洁高效的实现方案。

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

Question

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

Solution

int findMaxConsecutiveOnes(int* nums, int numsSize) {
    int i, sum = 0,index=0;
    
    int numsSum[numsSize];
    for (i = 0; i < numsSize; i++)
        numsSum[i]=0;
        
    for (i = 0; i < numsSize; i++) {
        if (nums[i]) {
            ++sum;
        } else {
            numsSum[index++] = sum;
            sum=0;
        }
    }
    
    numsSum[numsSize-1] = sum;
    
    sum = 0;
    
    for (i = 0; i < numsSize; i++)
        sum=numsSum[i]>sum?numsSum[i]:sum;
    
    return sum;
}

Solution best of others

简洁明了

int findMaxConsecutiveOnes(int* nums, int numsSize) {
  int curMax = 0; 
  int max; 
  for(int i = 0; i < numsSize; i++) {
    curMax = curMax * nums[i] + nums[i];
    if(curMax > max) {
      max = curMax;
    }
  }
  return max; 
}