题目:
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.
翻译:
给定一个包含数字的数组和一个数字 k ,在数组中找出两个不同的下标 i 和 j 使得 nums[i] = nums[j],并且 i 和 j 之间的据对距离不超过 k 。
思路:
用map最合适了,不用过多解释,key中存当前元素,value存该元素的下标。若map中当前没有找到该元素,填进去;若之前出现过,那么直接比较value中的下标和现在的下标。(对于map和unordered_map的区别参见 :https://blog.csdn.net/batuwuhanpei/article/details/50727227)
C++代码(Visual Studio 2017):
#include "stdafx.h"
#include <iostream>
#include <vector>
#include <map>
using namespace std;
class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
map<int, int> m;
for (int i = 0; i < nums.size(); i++) {
if (m.find(nums[i]) != m.end() && i - m[nums[i]] <= k)
return true;
else m[nums[i]] = i;
}
return false;
}
};
int main()
{
Solution s;
vector<int> nums = { 2,3,4,5,7,6,8,2,1 };
int k = 6;
bool result;
result = s.containsNearbyDuplicate(nums, k);
cout << result;
return 0;
}