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 givenindex
to be equal toval
.int snap()
takes a snapshot of the array and returns thesnap_id
: the total number of times we calledsnap()
minus1
.int get(index, snap_id)
returns the value at the givenindex
, at the time we took the snapshot with the givensnap_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 toset
,snap
, andget
. 0 <= index < length
0 <= snap_id <
(the total number of times we callsnap()
)0 <= val <= 10^9
思路:这题的考点在于,如果存整个array的历史信息,会爆空间,其实没有必要存所有的信息,只用存array ith元素的历史信息,这样每个点,用treemap去存,treemap可以按照key的顺序存储,search是log(n)的。
class SnapshotArray {
private List<TreeMap<Integer, Integer>> list;
private int id = 0;
public SnapshotArray(int length) {
list = new ArrayList<>();
for(int i = 0; i < length; i++) {
list.add(new TreeMap<Integer, Integer>());
list.get(i).put(0,0);
}
}
public void set(int index, int val) {
list.get(index).put(id, val);
}
public int snap() {
return id++;
}
public int get(int index, int snap_id) {
return list.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);
*/