[leetcode_219]Contains Duplicate II

求数组中,是否存在两个相同元素的小标差小于k。hash题目。

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) {
       map<int, int> mNums;
       mNums.clear();
       for (int i = 0;i < nums.size();i++)
       {
           map<int,int>::iterator it = mNums.find(nums[i]); 
           if (mNums.end() == it)
           {
               mNums.insert(pair<int,int>(nums[i], i));
           }
           else
           {
               if (i - it->second <= k)
               {
                   return true;
               }
               mNums.erase(it);
               mNums.insert(pair<int,int>(nums[i], i));
           }
       }
       return false;
    }
};
Licensed under CC BY-NC-SA 4.0