Skip to content

1046. Max Consecutive Ones III

Array Binary Search Sliding Window Prefix Sum

Problem - Max Consecutive Ones III

Medium

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 <= 105
  • nums[i] is either 0 or 1.
  • 0 <= k <= nums.length

Solutions

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
class Solution:
    def longestOnes(self, nums: List[int], k: int) -> int:
        left = count = 0

        for num in nums:
            count += num ^ 1
            if count > k:
                count -= nums[left] ^ 1
                left += 1

        return len(nums) - left

Submission Stats:

  • Runtime: 25 ms (99.18%)
  • Memory: 22.2 MB (22.64%)