最长定差子序列

给你一个整数数组 arr 和一个整数 difference，请你找出 arr 中所有相邻元素之间的差等于给定 difference 的等差子序列，并返回其中最长的等差子序列的长度。

 

示例 1：

输入：arr = [1,2,3,4], difference = 1
输出：4
解释：最长的等差子序列是 [1,2,3,4]。
示例 2：

输入：arr = [1,3,5,7], difference = 1
输出：1
解释：最长的等差子序列是任意单个元素。
示例 3：

输入：arr = [1,5,7,8,5,3,4,2,1], difference = -2
输出：4
解释：最长的等差子序列是 [7,5,3,1]。
 

提示：

1 <= arr.length <= 10^5
-10^4 <= arr[i], difference <= 10^4

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

 

class Solution {
public:
#if 0
    //超时版本
    int longestSubsequence(vector<int>& arr, int difference) 
    {
        int ret = INT_MIN;
        map<int, vector<int>> mymap;
        for(int i = 0; i < arr.size(); i++)
        {
            mymap[arr[i]].push_back(i);
        }
        for(auto it = mymap.begin(); it != mymap.end(); it++)
        {
            int target = it->first + difference;
            int index = it->second[0];
            int count = 1;
            while(1)
            {
                if(mymap.count(target) > 0)
                {
                    int i = 0; 
                    for(;i < mymap[target].size(); i++)
                    {
                        if(mymap[target][i] > index)
                        {
                            index = mymap[target][i];
                            count++;
                            break;
                        }
                    }
                    if(i == mymap[target].size())
                    {
                        ret = max(ret, count);
                        break;
                    }
                    target += difference;
                }
                else
                {
                    ret = max(ret, count);
                    break;
                }
                   
                
            }
           
        }
        return ret;
    }
    
#endif   
    //双百分百
    int longestSubsequence(vector<int>& arr, int difference) 
    {
        map<int, int> mymap;
        for(int i = 0; i < arr.size(); i++)
        {
            int target = arr[i] - difference;
             
            if(mymap.count(target) == 0)
            {
                mymap[arr[i]] = 1;
            }
            else
            {
                 mymap[arr[i]] = 1 + mymap[target];
            }
        }
        
        int ret = INT_MIN;
        for(auto it = mymap.begin(); it != mymap.end(); it++)
        {
            ret = max(ret, it->second);
        }
        return ret;
    }
};