详情

    没做出来
    动态规划，时间复杂度 O(n)，空间复杂度 O(n)

    1. func longestSubsequence(arr []int, difference int) (ans int) {
    2.     dp := map[int]int{}
    3.     for _, v := range arr {
    4.         dp[v] = dp[v-difference] + 1
    5.         if dp[v] > ans {
    6.             ans = dp[v]
    7.         }
    8.     }
    9.     return
    10. }