-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1146-SnapshotArray.go
More file actions
104 lines (92 loc) · 3.17 KB
/
1146-SnapshotArray.go
File metadata and controls
104 lines (92 loc) · 3.17 KB
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
99
100
101
102
103
104
package main
// 1146. Snapshot Array
// Implement a SnapshotArray that supports the following interface:
// SnapshotArray(int length) initializes an array-like data structure with the given length. Initially, each element equals 0.
// void set(index, val) sets the element at the given index to be equal to val.
// int snap() takes a snapshot of the array and returns the snap_id: the total number of times we called snap() minus 1.
// int get(index, snap_id) returns the value at the given index, at the time we took the snapshot with the given snap_id
// Example 1:
// Input: ["SnapshotArray","set","snap","set","get"]
// [[3],[0,5],[],[0,6],[0,0]]
// Output: [null,null,0,null,5]
// Explanation:
// SnapshotArray snapshotArr = new SnapshotArray(3); // set the length to be 3
// snapshotArr.set(0,5); // Set array[0] = 5
// snapshotArr.snap(); // Take a snapshot, return snap_id = 0
// snapshotArr.set(0,6);
// snapshotArr.get(0,0); // Get the value of array[0] with snap_id = 0, return 5
// Constraints:
// 1 <= length <= 5 * 10^4
// 0 <= index < length
// 0 <= val <= 10^9
// 0 <= snap_id < (the total number of times we call snap())
// At most 5 * 10^4 calls will be made to set, snap, and get.
import "fmt"
type Elem struct {
val int
version int
}
type SnapshotArray struct {
data [][]Elem
version int
}
func Constructor(length int) SnapshotArray {
return SnapshotArray{ make([][]Elem, length), 0 }
}
func (this *SnapshotArray) Set(index int, val int) {
// Update value if we are at the same version
if len(this.data[index]) > 0 {
arr := this.data[index]
if arr[len(arr)-1].version == this.version {
this.data[index][len(arr)-1].val = val
return
}
}
// Add new record if we are at the higher version
this.data[index] = append(this.data[index], Elem{val, this.version})
}
func (this *SnapshotArray) Snap() int {
old := this.version
this.version++
return int(old)
}
func (this *SnapshotArray) Get(index int, snap_id int) int {
// Binary search for the exact snap_id or the first below it
arr := this.data[index]
l, r := 0, len(arr) - 1
for l <= r {
m := (l + r) / 2
if arr[m].version == snap_id {
return arr[m].val
} else if arr[m].version < snap_id {
l, r = m + 1, r
} else {
l, r = l, m - 1
}
}
if l - 1 <= len(arr) && l - 1 >= 0 {
return arr[l-1].val
}
return 0
}
/**
* Your SnapshotArray object will be instantiated and called as such:
* obj := Constructor(length);
* obj.Set(index,val);
* param_2 := obj.Snap();
* param_3 := obj.Get(index,snap_id);
*/
func main() {
// SnapshotArray snapshotArr = new SnapshotArray(3); // set the length to be 3
obj := Constructor(3)
// snapshotArr.set(0,5); // Set array[0] = 5
obj.Set(0,5)
fmt.Println(obj)
// snapshotArr.snap(); // Take a snapshot, return snap_id = 0
fmt.Println(obj.Snap()) // 0
// snapshotArr.set(0,6);
obj.Set(0,6)
fmt.Println(obj)
// snapshotArr.get(0,0); // Get the value of array[0] with snap_id = 0, return 5
fmt.Println(obj.Get(0,0)) // 5
}