leetcode-485. Max Consecutive Ones

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

link_98

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

阅读量195

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode LeetCode题解文章标签： java leetcode

本文链接：https://blog.youkuaiyun.com/qq_32832023/article/details/78343712

LeetCode题解同时被 2 个专栏收录

60 篇文章

订阅专栏

LeetCode

59 篇文章

订阅专栏

本文介绍了一种高效算法来解决寻找二进制数组中最大连续1的问题。通过两个不同实现方式对比，展示了如何利用简单逻辑达到最优性能。算法核心在于遍历数组并计数连续1的数量，同时更新最大值。

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

485. Max Consecutive Ones

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的时候，用库会快很多。。第一种方法太傻了o(╥﹏╥)o

class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
                    int[] solu = new int[nums.length];
            int count = 0,flag = 0;
            for (int i = 0; i < nums.length; i++) {
                if(nums[i]==1){
                    for (int j = i;j<nums.length;j++){
                        if(nums[j]==1&&j != nums.length -1) {
                            count++;                          
                        }
                        else if(nums[j] == 1&& j == nums.length -1){
                            count++;
                            solu[flag] = count;
                            flag++;
                        }
                        else{
                            //list.add(count);
                            solu[flag] = count;
                            flag++;
                            break;
                        }

                    }
                    count = 0;
                }
            }
            Arrays.sort(solu);
            return solu[solu.length-1];
    }
}

Runtime: 510 ms

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

Runtime: 11 ms