-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest-sets-map.js
91 lines (61 loc) · 1.77 KB
/
test-sets-map.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
class Solution {
constructor() {
this.keyStore = new Map();
}
set(key, val, time) {
if(this.keyStore.has(key)) {
let sub = this.keyStore.get(key)
this.keyStore.set(time, val)
}
else {
let subMap = new Map()
subMap.set(time, val)
this.keyStore.set(key, subMap)
}
return this.keyStore
}
get(key, time) {
let found=null, key
if(this.keyStore.has(key)) {
let sub = this.keyStore.get(key)
if(sub.has(key)) {
found = sub.get(time)
return found
}
else {
let allKeys = Array.from(this.keyStore.get('alice').keys())
key = this.searchBST(allKeys, target)
found = sub.get(key)
}
}
return found || null
}
searchBST(nums, target) {
let l = 0, r = nums.length-1, m, last = nums.length-1
if(nums[last] < target) return last
if(nums[0] > target) return 0
while(l <= r) {
m = l + Math.floor((r-l)/2)
if(t > nums[m]) {
val = nums[m]
l = m + 1
}
else {
r = m - 1
}
}
return val
}
createMap(data=[]) {
let map = new Map()
data.forEach(element => {
map = this.set(element[0], element[1], element[2], map)
});
return map
}
}
let arr = [["alice", "happy", 1], ["alice", "sad", 2], ["alice", "anger", 3], ["polaa", "khola", 1]]
let instance = new Solution()
let bst = instance.createMap(arr)
let closest = instance.findClosest([2,3,5,7,9], 3)
console.log(closest)