#1218 Longest Arithmetic Subsequence of Given Difference

Description

Given an integer array arr and an integer difference, return the length of the longest subsequence in arr which is an arithmetic sequence such that the difference between adjacent elements in the subsequence equals difference.

A subsequence is a sequence that can be derived from arr by deleting some or no elements without changing the order of the remaining elements.

Examples

Example 1:

Input: arr = [1,2,3,4], difference = 1
Output: 4
Explanation: The longest arithmetic subsequence is [1,2,3,4].

Example 2:

Input: arr = [1,3,5,7], difference = 1
Output: 1
Explanation: The longest arithmetic subsequence is any single element.

Example 3:

Input: arr = [1,5,7,8,5,3,4,2,1], difference = -2
Output: 4
Explanation: The longest arithmetic subsequence is [7,5,3,1].

Constraints:

1 <= arr.length <= $10^5$
$-10^4$ <= arr[i], difference <= $10^4$

思路

用dp，但是dp[i]存的是以i为结尾的maxSubSequence，所以用map存

代码

class Solution {
    public int longestSubsequence(int[] arr, int difference) {
        Map<Integer, Integer> dp = new HashMap<>();
        int max = 0;
        
        for (int a: arr) {
            int count = dp.getOrDefault(a - difference, 0) + 1;
            max = Math.max(count, max);
            dp.put(a, Math.max(dp.getOrDefault(a - difference, 0), count));
        }
        
        return max;
    }
}