3-30 力扣解决动态规划等差数列2题
1)368.最大整除数集
思考:如果满足num[i]%nums[j]==0,那么就可以让这一组数列加1,即dp[i]=dp[j]+1
def largestDivisibleSubset(self, nums: List[int]) -> List[int]:
if not nums: return nums
if len(nums) == 1: return nums
dp = [[i] for i in nums]
for i in range(1,len(nums)):
for j in range(i):
if nums[i]%nums[j] == 0:
dp[i] = max(dp[i],dp[j]+[nums[i]],key = len)
return max(dp,key=len)
2)1218-最长定差子序列
思考:dp[i]表示以num[i]结尾的数列,那么想知道到dp[i]为止,以difference为等差的数列有多少,就是求dp[i-diff]有多少个,最后再加上一。
def longestSubsequence(self, arr: List[int], difference: int) -> int:
d = {}
for i in arr:
d[i] = d.get(i-difference,0)+1
return max(d.values())