首页 > 代码库 > 219. 数组重复元素2 Contains Duplicate II
219. 数组重复元素2 Contains Duplicate II
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.
public class Solution {
public bool ContainsNearbyDuplicate(int[] nums, int k) {
Dictionary<int, int> dict = new Dictionary<int, int>();
for (int i = 0; i < nums.Length; i++) {
int index;
if (dict.TryGetValue(nums[i], out index)) {
if (i - index <= k) {
return true;
}
}
dict[nums[i]] = i;
}
return false;
}
}
null
219. 数组重复元素2 Contains Duplicate II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。