-
Notifications
You must be signed in to change notification settings - Fork 17
/
ContainsNearbyDuplicate.kt
73 lines (57 loc) · 2 KB
/
ContainsNearbyDuplicate.kt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
package com.daily.algothrim.leetcode.top150
/**
* 219. 存在重复元素 II
*/
/*
给你一个整数数组 nums 和一个整数 k ,判断数组中是否存在两个 不同的索引 i 和 j ,满足 nums[i] == nums[j] 且 abs(i - j) <= k 。如果存在,返回 true ;否则,返回 false 。
示例 1:
输入:nums = [1,2,3,1], k = 3
输出:true
示例 2:
输入:nums = [1,0,1,1], k = 1
输出:true
示例 3:
输入:nums = [1,2,3,1,2,3], k = 2
输出:false
提示:
1 <= nums.length <= 105
-109 <= nums[i] <= 109
0 <= k <= 105
*/
class ContainsNearbyDuplicate {
companion object {
@JvmStatic
fun main(args: Array<String>) {
println(ContainsNearbyDuplicate().containsNearbyDuplicate(intArrayOf(1, 2, 3, 1), 3))
println(ContainsNearbyDuplicate().containsNearbyDuplicate(intArrayOf(1, 0, 1, 1), 1))
println(ContainsNearbyDuplicate().containsNearbyDuplicate(intArrayOf(1, 2, 3, 1, 2, 3), 2))
println(ContainsNearbyDuplicate().containsNearbyDuplicate2(intArrayOf(1, 2, 3, 1), 3))
println(ContainsNearbyDuplicate().containsNearbyDuplicate2(intArrayOf(1, 0, 1, 1), 1))
println(ContainsNearbyDuplicate().containsNearbyDuplicate2(intArrayOf(1, 2, 3, 1, 2, 3), 2))
}
}
fun containsNearbyDuplicate(nums: IntArray, k: Int): Boolean {
val map = hashMapOf<Int, Int>()
for (i in nums.indices) {
if (map.containsKey(nums[i])) {
val index = map.getOrDefault(nums[i], 0)
if (i - index <= k) return true
map.remove(nums[i])
}
map[nums[i]] = i
}
return false
}
fun containsNearbyDuplicate2(nums: IntArray, k: Int): Boolean {
val set = hashSetOf<Int>()
for (i in nums.indices) {
if (i > k) {
set.remove(nums[i - k - 1])
}
if (!set.add(nums[i])) {
return true
}
}
return false
}
}