-
Notifications
You must be signed in to change notification settings - Fork 21
/
1146. Snapshot Array.java
executable file
·89 lines (75 loc) · 2.77 KB
/
1146. Snapshot Array.java
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
M
tags: Array, Hash Table, TreeMap
time: O(1) set, O(logn) get, O(x) snap, x = # of changes
space: O(n * m), n = array size, m = # of snaps
#### Hash Table, TreeMap; atomic save
- store efficiently: use List<Map<snapId, val>>. only preserve changed itemd
- if no match, find last modifed item based on snapId, use TreeMap.floorEntry
- map.floorEntry(id) return the item.key lower or equal to id
- Utilize a `buffer: Map<Integer, Integer>` and perform atomic save
```
/*
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 <= 50000
At most 50000 calls will be made to set, snap, and get.
0 <= index < length
0 <= snap_id < (the total number of times we call snap())
0 <= val <= 10^9
*/
class SnapshotArray {
List<TreeMap<Integer, Integer>> snaps;
Map<Integer, Integer> buffer;
int snapId = 0;
public SnapshotArray(int length) {
buffer = new HashMap<>();
snaps = new ArrayList<>();
for (int i = 0; i < length; i++) {
snaps.add(new TreeMap<>());
snaps.get(i).put(snapId, 0);
}
}
public void set(int index, int val) {
buffer.put(index, val);
}
public int snap() {
for (int index : buffer.keySet()) {
snaps.get(index).put(snapId, buffer.get(index));
}
buffer = new HashMap<>();
snapId++;
return snapId - 1;
}
public int get(int index, int snap_id) {
return snaps.get(index).floorEntry(snap_id).getValue();
}
}
/**
* Your SnapshotArray object will be instantiated and called as such:
* SnapshotArray obj = new SnapshotArray(length);
* obj.set(index,val);
* int param_2 = obj.snap();
* int param_3 = obj.get(index,snap_id);
*/
/**
* Your SnapshotArray object will be instantiated and called as such:
* SnapshotArray obj = new SnapshotArray(length);
* obj.set(index,val);
* int param_2 = obj.snap();
* int param_3 = obj.get(index,snap_id);
*/
```