3176-find-the-maximum-length-of-a-good-subsequence-i.adoc

3176. Find the Maximum Length of a Good Subsequence I

{leetcode}/problems/find-the-maximum-length-of-a-good-subsequence-i/[LeetCode - 3176. Find the Maximum Length of a Good Subsequence I ^]

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 <span data-keyword="subsequence-array">subsequence of nums.

Example 1:

<div class="example-block"> Input: <span class="example-io">nums = [1,2,1,1,3], k = 2

Output: <span class="example-io">4

Explanation:

The maximum length subsequence is 1,2,1,1,3].

Example 2:

<div class="example-block"> Input: <span class="example-io">nums = [1,2,3,4,5,1], k = 0

Output: <span class="example-io">2

Explanation:

The maximum length subsequence is 1,2,3,4,5,1].

Constraints:

• 1 ⇐ nums.length ⇐ 500

• 1 ⇐ nums[i] ⇐ 109

• 0 ⇐ k ⇐ min(nums.length, 25)

思路分析

一刷

link:{sourcedir}/_3176_FindTheMaximumLengthOfAGoodSubsequenceI.java[role=include]

参考资料