class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
if(nums.size() < 2)
{
return false;
}
vector<int> temp = nums;
sort(temp.begin(), temp.end());
for(int i = 0; i < temp.size() - 1; i++)
{
if(temp[i] == temp[i + 1])
{
int low = distance(nums.begin(), find(nums.begin(), nums.end(), temp[i]));
nums[low] = INT_MAX;
int high = distance(nums.begin(), find(nums.begin(), nums.end(), temp[i]));
if(high - low <= k)
{
return true;
}
}
}
return false;
}
};
leetcode 219. 存在重复元素 II
最新推荐文章于 2020-07-29 16:58:20 发布