题目:
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute difference between i and j is at most k.
Example 1:
Input: nums = [1,2,3,1], k = 3, t = 0 Output: true
Example 2:
Input: nums = [1,0,1,1], k = 1, t = 2 Output: true
Example 3:
Input: nums = [1,5,9,1,5,9], k = 2, t = 3 Output: false
Constraints:
0 <= nums.length <= 2 * 104
-231 <= nums[i] <= 231 - 1
0 <= k <= 104
0 <= t <= 231 - 1
代码:
class Solution {
public:
bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {
if(nums.size() < 1)
return false;
set<double> s;
for(int i = 0; i<nums.size(); i++)
{
if(i > k)
s.erase(nums[i - k - 1]);
double tmp = double(nums[i]) - double(t);
auto p = s.lower_bound(tmp);
tmp = double(nums[i]) + double(t);
if(p != s.end() && *p <= tmp)
return true;
s.insert(nums[i]);
}
return false;
}
};