[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。其實應該用二叉搜尋樹的。等看了再寫吧。

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

 

[LeetCode]Contains Duplicate III