[刷题] LeetCode 220 Contains Duplicate III

 1 class Solution {
 2 public:
 3     bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {
 4         if(t < 0)
 5             return false;
 6 
 7         set<long long> record;
 8         for(int i = 0 ; i < nums.size() ; i ++){
 9 
10             if(record.lower_bound((long long)nums[i] - (long long)t) != record.end() &&
11                 *record.lower_bound((long long)nums[i] - (long long)t ) <= (long long)nums[i] + (long long)t)
12                 return true;
13 
14             record.insert(nums[i]);
15 
16             if(record.size() == k + 1)
17                 record.erase( nums[i-k] );
18         }
19 
20         return false;
21     }
22 };