leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0220.cpp (533B)

0 class Solution { 1 public: 2 bool containsNearbyAlmostDuplicate(const vector<int> &nums, int indexDiff, int valueDiff) const { 3 multiset<int> st; 4 5 for (int i = 0; i < size(nums); i++) { 6 const auto it = st.insert(nums[i]); 7 if (it != begin(st) && nums[i] - *prev(it) <= valueDiff) return true; 8 if (next(it) != end(st) && *next(it) - nums[i] <= valueDiff) return true; 9 10 if (size(st) > indexDiff) st.extract(nums[i - indexDiff]); 11 } 12 13 return false; 14 } 15 };