LeetCode 0219 - Contains Duplicate II
Contains Duplicate II
Desicription
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:
1 | Input: nums = [1,2,3,1], k = 3 |
Example 2:
1 | Input: nums = [1,0,1,1], k = 1 |
Example 3:
1 | Input: nums = [1,2,3,1,2,3], k = 2 |
Solution
1 | class Solution { |