1 class Solution: 2 def longestSubsequence(self, arr: List[int], difference: int) -> int: 3 dp = collections.defaultdict(int) 4 result = 0 5 for val in arr: 6 dp[val] = dp[val-difference] + 1 7 if dp[val] > result: 8 result = dp[val] 9 return result
1 class Solution: 2 def longestSubsequence(self, arr: List[int], difference: int) -> int: 3 dp = collections.defaultdict(int) 4 result = 0 5 for val in arr: 6 dp[val] = dp[val-difference] + 1 7 if dp[val] > result: 8 result = dp[val] 9 return result
上一篇:leetcode1228
下一篇:leetcode1221
【LeetCode】39. 组合总和
【LeetCode】705. 设计哈希集合
【LeetCode】706. 设计哈希映射
举报文章
请选择举报类型
补充说明
0/200
上传截图
格式支持JPEG/PNG/JPG,图片不超过1.9M