class Solution:
def longestSubsequence(self, arr: List[int], difference: int) -> int:
dp = defaultdict(int)
for v in arr:
dp[v] = dp[v - difference] + 1
return max(dp.values())
最长定差子序列
最新推荐文章于 2024-05-16 11:25:51 发布