Package g3101_3200.s3177_find_the_maximum_length_of_a_good_subsequence_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3177 - Find the Maximum Length of a Good Subsequence II.

    Hard

    You are given an integer array nums and a non-negative integer k. A sequence of integers seq is called good if there are at most k indices i in the range [0, seq.length - 2] such that seq[i] != seq[i + 1].

    Return the maximum possible length of a good subsequence of nums.

    Example 1:

    Input: nums = 1,2,1,1,3, k = 2

    Output: 4

    Explanation:

    The maximum length subsequence is <code><ins>1</ins>,<ins>2</ins>,<ins>1</ins>,<ins>1</ins>,3</code>.

    Example 2:

    Input: nums = 1,2,3,4,5,1, k = 0

    Output: 2

    Explanation:

    The maximum length subsequence is <code><ins>1</ins>,2,3,4,5,<ins>1</ins></code>.

    Constraints:

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

    • <code>1 <= numsi<= 10<sup>9</sup></code>

    • 0 &lt;= k &lt;= min(50, 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 maximumLength(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

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