Leetcode——最长定差子序列

Posted 2022-12-01 Yawn__

1. 最长定差子序列

（1）DP（数组）

class Solution 
    public int longestSubsequence(int[] arr, int difference) 
        int ans = 0;
        int[] dp = new int[40001];
        for (int num : arr) 
            dp[num + 20000] = dp[num + 20000 - difference] + 1; 
            ans = Math.max(ans, dp[num + 20000]);
        
        return ans;