LeetCode 솔루션 분류
[10/21] 219. Contains Duplicate II
본문
Easy
41002351Add to ListShareGiven 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] <= 1090 <= k <= 105
Accepted
600,464
Submissions
1,421,091
관련자료
-
링크
댓글 0
등록된 댓글이 없습니다.
