leetcode - 1004. Max Consecutive Ones III

KpLn_HJL

于 2024-02-01 04:57:04 发布

阅读量460

点赞数 7

分类专栏： OJ题目记录文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/sinat_41679123/article/details/135965234

版权

OJ题目记录专栏收录该内容

576 篇文章

订阅专栏

该文章讨论了一个编程问题，给定一个二进制数组和一个整数k，目标是找到在允许翻转不超过k个0后，数组中最大连续1的数量。使用滑动窗口策略并考虑空间复杂度，提供了一种解决方案和时间复杂度分析。

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

Description

Given a binary array nums and an integer k, return the maximum number of consecutive 1’s in the array if you can flip at most k 0’s.

Example 1:

Input: nums = [1,1,1,0,0,0,1,1,1,1,0], k = 2
Output: 6
Explanation: [1,1,1,0,0,1,1,1,1,1,1]
Bolded numbers were flipped from 0 to 1. The longest subarray is underlined.

Example 2:

Input: nums = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], k = 3
Output: 10
Explanation: [0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,1,1]
Bolded numbers were flipped from 0 to 1. The longest subarray is underlined.

Constraints:

1 <= nums.length <= 10^5
nums[i] is either 0 or 1.
0 <= k <= nums.length

Solution

Solved after hints.

Use a sliding window, make sure there are no more than k 0s inside the window.

Time complexity: $o (n)$
Space complexity: $o (n)$

Code

class Solution:
    def longestOnes(self, nums: List[int], k: int) -> int:
        zero_cnt = 0
        left = 0
        res = 0
        for right in range(len(nums)):
            # put new item into window
            if nums[right] == 0:
                zero_cnt += 1
            # check if need to shrink the window
            while zero_cnt > k:
                if nums[left] == 0:
                    zero_cnt -= 1
                left += 1
            res = max(res, right - left + 1)
        return res