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].
Constraints:
1 <= arr.length <= 10^5 -10^4 <= arr[i], difference <= 10^4
Solution:
class Solution {
public:
int longestSubsequence(vector<int>& arr, int difference) {
int result = 0;
map<int, int> m;
for (int n : arr) {
int len = map_contains_key(m, n - difference) ? m[n - difference] + 1 : 1;
if (map_contains_key(m, n)) len = max(len, m[n]);
m[n] = len;
result = max(result, len);
}
return result;
}
template <typename key_t, typename value_t>
static bool map_contains_key(const map<key_t, value_t>& m, const key_t& k) {
return m.find(k) != m.end();
}
};