最长定差子序列 【动态规划】

let arr = [1, 20, 3, 40, 5, 60, 7, 8],
  d = 2;
let map = new Map(arr.map((e) => [e, 1]));
let max = 1;
for (let i = 1; i < arr.length; i++) {
  if (map.has(arr[i] - d)) {
    map.set(arr[i], map.get(arr[i] - d) + 1);
    max = Math.max(map.get(arr[i]), max);
  }
}
console.log(map, max);

mp