-
Notifications
You must be signed in to change notification settings - Fork 0
/
220.contains-duplicate-iii.js
98 lines (95 loc) · 2.26 KB
/
220.contains-duplicate-iii.js
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
/*
* @lc app=leetcode id=220 lang=javascript
*
* [220] Contains Duplicate III
*/
// @lc code=start
/**
* @param {number[]} nums
* @param {number} range
* @param {number} diff
* @return {boolean}
*/
// this is just like what they do with built-in set
const containsNearbyAlmostDuplicate = (nums, range, diff) => {
if (range <= 0 || diff < 0) {
return false
}
let count = 0,
orderedSet = null
for (let i = 0; i < nums.length; i++) {
if (count > 0 && findNearest(orderedSet, nums[i]) <= diff) {
return true
}
orderedSet = add(orderedSet, nums[i])
if (++count > range) {
orderedSet = del(orderedSet, nums[i - range])
count--
}
}
return false
}
// // definition of my BST
class TreeNode {
constructor(value, left = null, right = null) {
this.value = value
this.left = left
this.right = right
}
}
// insert an element
const add = (root, value) => {
if (root === null) {
return new TreeNode(value)
}
if (value < root.value) {
root.left = add(root.left, value)
} else {
root.right = add(root.right, value)
}
return root
}
// delete an element
const del = (root, value) => {
if (root === null) {
return null
}
if (root.value === value) {
if (root.left !== null && root.right !== null) {
// if both children is present, find the smallest value in its right
// subtree and replace value of current node. Then delete the
// value in its right subtree recursively.
let p = root.right
while (p.left !== null) {
p = p.left
}
root.value = p.value
root.right = del(root.right, p.value)
return root
} else {
// else return the present child or null
return root.left || root.right
}
} else if (value > root.value) {
root.right = del(root.right, value)
} else {
root.left = del(root.left, value)
}
return root
}
// find nearest in BFS
const findNearest = (root, value) => {
if (!root) return Infinity
const dist = Math.abs(root.value - value)
if (dist === 0) {
return 0
} else if (root.value > value) {
return Math.min(dist, findNearest(root.left, value))
} else {
return Math.min(dist, findNearest(root.right, value))
}
}
// @lc code=end
module.exports = {
containsNearbyAlmostDuplicate
}