class Solution {
public int longestSubsequence( int[] arr,
int difference) {
Map<Integer, Integer> map = new HashMap<>();
int ret = 0;
for (int k : arr) {
int pre = k - difference;// 前驱
// 序列增加数k,因此长度加1
int len = map.getOrDefault(pre, 0) + 1;
ret = Math.max(ret, len);
map.put(k, len);// 更新map
}
return ret;
}
}