Contains Duplicate III

[leetcode]Contains Duplicate III

链接：https://leetcode.com/problems/contains-duplicate-iii/description/

Question

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

Example 1

Input: nums = [1,2,3,1], k = 3, t = 0
Output: true

Example 2

Input: nums = [1,0,1,1], k = 1, t = 2
Output: true

Example 3

Input: nums = [1,5,9,1,5,9], k = 2, t = 3
Output: false

Solution

// 很恶心，会越界，一定要在nums外面加上强制转换为long long
class Solution {
public:
  bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {
    // 相当于一个窗口
    multiset<long long int> myset;
    for (int i = 0; i < nums.size(); i++) {
      // 保持窗口的大小最大为k
      if (i > k) myset.erase(nums[i-k-1]);
      // 显然我们需要找|x-nums[i]|<=t，也就是说x-nums[i] <= t && x-nums[i] >= -t
      // 所以这里我们分开找，先找满足x-nums[i] >= -t也就是x >= nums[i]-t的值
      auto lb = myset.lower_bound((long long int)nums[i]-t);
      // 在这种情况下，还需要满足x-nums[i] <= t
      if (lb != myset.end() && *lb - nums[i] <= t) return true;
      myset.insert((long long int)nums[i]);
    }
    return false;
  }
};

思路：技巧性比较强，具体参考注释。