标签:
1 class Solution 2 { 3 public: 4 bool containsNearbyAlmostDuplicate(vector<int> &nums, int k, int t) 5 { 6 multiset<int> S; 7 int start = 0, end = 0; 8 for(int i=0; i<nums.size(); i++) 9 { 10 if(S.size() == k+1) S.erase(nums[i-k-1]); 11 auto it = S.lower_bound(nums[i]-t); 12 if(it != S.end() && abs(*it - nums[i]) <= t) return true; 13 S.insert(nums[i]); 14 } 15 16 return false; 17 } 18 };
[leetcode] Contains Duplicate III
标签:
原文地址:http://www.cnblogs.com/lxd2502/p/4595437.html