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