【LeetCode】1218. Longest Arithmetic Subsequence of Given Difference

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接：https://blog.csdn.net/shiliang97/article/details/102527497

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.

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].

来源：力扣（LeetCode） 链接：https://leetcode-cn.com/problems/longest-arithmetic-subsequence-of-given-difference 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

很巧妙的算法，但是不是我想的 枯了

class Solution {
public:
    int longestSubsequence(vector<int>& arr, int difference) {
        int ans=0;
        map<int,int>mp;
        for(auto x:arr){
            ans=max(ans,mp[x]=mp[x-difference]+1);
        }return ans;
    }
};