luzhipeng 18eec7c Mar 28, 2019
0 contributors

### Users who have contributed to this file

103 lines (84 sloc) 1.91 KB

## 题目地址

https://leetcode.com/problems/contains-duplicate-ii/description/

## 题目描述

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.

Example 1:

Input: nums = [1,2,3,1], k = 3
Output: true
Example 2:

Input: nums = [1,0,1,1], k = 1
Output: true
Example 3:

Input: nums = [1,2,3,1,2,3], k = 2
Output: false

## 代码

/*
* @lc app=leetcode id=219 lang=javascript
*
* [219] Contains Duplicate II
*
* https://leetcode.com/problems/contains-duplicate-ii/description/
*
* algorithms
* Easy (34.75%)
* Total Accepted:    187.3K
* Total Submissions: 537.5K
* Testcase Example:  '[1,2,3,1]\n3'
*
* 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.
*
*
* Example 1:
*
*
* Input: nums = [1,2,3,1], k = 3
* Output: true
*
*
*
* Example 2:
*
*
* Input: nums = [1,0,1,1], k = 1
* Output: true
*
*
*
* Example 3:
*
*
* Input: nums = [1,2,3,1,2,3], k = 2
* Output: false
*
*
*
*
*
*/
/**
* @param {number[]} nums
* @param {number} k
* @return {boolean}
*/
var containsNearbyDuplicate = function(nums, k) {
const visited = {};
for(let i = 0; i < nums.length; i++) {
const num = nums[i];
if (visited[num] !== undefined && i - visited[num] <= k) {
return true;
}
visited[num] = i;
}
return false
};
You can’t perform that action at this time.