[Leetcode]#219 Contains Duplicate II

//#219 Contains Duplicate II//76ms 12.69%#include <iostream>#include <vector>#include <set>#include <map>using namespace std;class Solution {public:    bool containsNearbyDuplicate(vector<int>& nums, int k)     {        map<int, int> mp;        int size = nums.size();        for(int i=0; i<size; i++)        {            if(mp.count(nums[i]) > 0)            {                if(i - mp[nums[i]] <= k)                {                    return true;                }                else                {                    mp[nums[i]] = i;                }            }            else            {                mp.insert(pair<int, int>(nums[i], i));            }        }        return false;    }};