[LeetCode]Contains Duplicate III

Contains Duplicate III

 Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between i and j is at most k.

O(nk)时间复杂度的时间超限，无语，参考这个的，用的set。其实应该用二叉搜索树的。等看了再写吧。

class Solution {
public:
    bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {
    set<int> window;
    for (int i = 0; i < nums.size(); i++) 
    {
        if (i > k) window.erase(nums[i-k-1]);
        auto pos = window.lower_bound(nums[i] - t);
        if (pos != window.end() && *pos - nums[i] <= t)
               return true;
        window.insert(nums[i]);
    }
    return false;
}
};