add 1146

Author: luliyucoordinate

README.md

@@ -467,4 +467,5 @@ LeetCode
 |1139|[Largest 1-Bordered Square](https://leetcode.com/problems/largest-1-bordered-square/) | c | [c++](./src/1139-Largest-1-Bordered-Square/1139.cpp) |[python](./src/1139-Largest-1-Bordered-Square/1139.py)|[go](./src/1139-Largest-1-Bordered-Square/1139.go)|[js](./src/1139-Largest-1-Bordered-Square/1139.js)|Medium|
 |1140|[Stone Game II](https://leetcode.com/problems/stone-game-ii/) | c | [c++](./src/1140-Stone-Game-II/1140.cpp) |[python](./src/1140-Stone-Game-II/1140.py)|[go](./src/1140-Stone-Game-II/1140.go)|[js](./src/1140-Stone-Game-II/1140.js)|Medium|
 |1144|[Decrease Elements To Make Array Zigzag](https://leetcode.com/problems/decrease-elements-to-make-array-zigzag/) | c | [c++](./src/1144-Decrease-Elements-To-Make-Array-Zigzag/1144.cpp) |[python](./src/1144-Decrease-Elements-To-Make-Array-Zigzag/1144.py)|[go](./src/1144-Decrease-Elements-To-Make-Array-Zigzag/1144.go)|[js](./src/1144-Decrease-Elements-To-Make-Array-Zigzag/1144.js)|Medium|
-|1144|[Binary Tree Coloring Game](https://leetcode.com/problems/binary-tree-coloring-game/) | c | [c++](./src/1145-Binary-Tree-Coloring-Game/1145.cpp) |[python](./src/1145-Binary-Tree-Coloring-Game/1145.py)|[go](./src/1145-Binary-Tree-Coloring-Game/1145.go)|[js](./src/1145-Binary-Tree-Coloring-Game/1145.js)|Medium|
+|1145|[Binary Tree Coloring Game](https://leetcode.com/problems/binary-tree-coloring-game/) | c | [c++](./src/1145-Binary-Tree-Coloring-Game/1145.cpp) |[python](./src/1145-Binary-Tree-Coloring-Game/1145.py)|[go](./src/1145-Binary-Tree-Coloring-Game/1145.go)|[js](./src/1145-Binary-Tree-Coloring-Game/1145.js)|Medium|
+|1146|[Snapshot Array](https://leetcode.com/problems/snapshot-array/) | c | [c++](./src/1146-Snapshot-Array/1146.cpp) |[python](./src/1146-Snapshot-Array/1146.py)|[go](./src/1146-Snapshot-Array/1146.go)|[js](./src/1146-Snapshot-Array/1146.js)|Medium|

src/1146-Snapshot-Array/1146.cpp

@@ -0,0 +1,25 @@
+class SnapshotArray 
+{
+public:
+    SnapshotArray(int length) {}
+    
+    void set(int index, int val) 
+    {
+        dif[index] = val;
+    }
+    
+    int snap() 
+    {
+        snaps.push_back(dif);
+        return snaps.size() - 1;
+    }
+    
+    int get(int index, int snap_id) 
+    {
+        if (snaps[snap_id].count(index)) return snaps[snap_id][index];
+        return 0;
+    }
+private:
+    unordered_map<int, int> dif;
+    vector<unordered_map<int, int>> snaps;
+};

src/1146-Snapshot-Array/1146.go

@@ -0,0 +1,36 @@
+/**
+ * @param {number} length
+ */
+var SnapshotArray = function(length) {
+    this.dif = new Map();
+    this.snaps = [];
+};
+
+/** 
+ * @param {number} index 
+ * @param {number} val
+ * @return {void}
+ */
+SnapshotArray.prototype.set = function(index, val) {
+    this.dif.set(index, val);
+};
+
+/**
+ * @return {number}
+ */
+SnapshotArray.prototype.snap = function() {
+    this.snaps.push(new Map(this.dif));
+    return this.snaps.length - 1;
+};
+
+/** 
+ * @param {number} index 
+ * @param {number} snap_id
+ * @return {number}
+ */
+SnapshotArray.prototype.get = function(index, snap_id) {
+    if (this.snaps[snap_id].has(index)) {
+        return this.snaps[snap_id].get(index);
+    }
+    return 0;
+};

src/1146-Snapshot-Array/1146.js

@@ -0,0 +1,14 @@
+class SnapshotArray:
+    def __init__(self, length: int):
+        self.dif = {}
+        self.snaps = []
+
+    def set(self, index: int, val: int) -> None:
+        self.dif[index] = val
+
+    def snap(self) -> int:
+        self.snaps.append(self.dif.copy())
+        return len(self.snaps) - 1
+
+    def get(self, index: int, snap_id: int) -> int:
+        return self.snaps[snap_id][index] if index in self.snaps[snap_id] else 0