leetcode

Solution to some Leetcode problems written in C++

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

0219.cpp (476B)

0 class Solution { 1 public: 2 bool containsNearbyDuplicate(vector<int> &nums, int k) { 3 unordered_set<int> us; 4 int n = nums.size(), i; 5 for (i = 0; i <= k && i < n; i++) { 6 if (us.count(nums[i])) return true; 7 us.insert(nums[i]); 8 } 9 10 for (; i < n; i++) { 11 us.erase(nums[i - k - 1]); 12 if (us.count(nums[i])) return true; 13 us.insert(nums[i]); 14 } 15 16 return false; 17 } 18 };