LeetCode *** 220. Contains Duplicate III　（set::lower_bound）

本文主要是介绍LeetCode *** 220. Contains Duplicate III　（set::lower_bound），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

题目：

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.

分析：

代码：

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

这篇关于LeetCode *** 220. Contains Duplicate III　（set::lower_bound）的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---