#3177

Find the Maximum Length of a Good Subsequence II

international master · 2100 · lc hard +32 · 25.1% accepted · 142 likes · top 4%

Description

Given an integer array nums and a non-negative integer k, a subsequence is good if adjacent differing-value pairs number at most k. Return the maximum length of a good subsequence (larger-constraint version).

Code

1

2

3

class Solution:
    def maximumLength(self, nums: List[int], k: int) -> int:

class Solution:
    def maximumLength(self, nums: List[int], k: int) -> int: