• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0201_0300.s0219_contains_duplicate_ii.readme.md Maven / Gradle / Ivy

219\. Contains Duplicate II

Easy

Given an integer array `nums` and an integer `k`, return `true` if there are two **distinct indices** `i` and `j` in the array such that `nums[i] == nums[j]` and `abs(i - j) <= 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 

**Constraints:**

*   1 <= nums.length <= 105
*   -109 <= nums[i] <= 109
*   0 <= k <= 105