Package g1001_1100.s1004_max_consecutive_ones_iii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1004 - 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,<ins> **1** ,1,1,1,1, **1** </ins> 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,<ins>1,1, **1** , **1** ,1,1,1, **1** ,1,1</ins>,0,0,0,1,1,1,1 Bolded numbers were flipped from 0 to 1. The longest subarray is underlined.

    Constraints:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • nums[i] is either 0 or 1.

    • 0 &lt;= k &lt;= nums.length

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer longestOnes(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait