Runtime: 366 ms (Top 61.08%) | Memory: 85.5 MB (Top 97.26%)

Author: AnasImloul

scripts/algorithms/S/Snapshot Array/Snapshot Array.cpp

@@ -1,11 +1,12 @@
+// Runtime: 366 ms (Top 61.08%) | Memory: 85.5 MB (Top 97.26%)
 class SnapshotArray {
     int timestamp;
     unordered_map<int, vector<int>> toSnaps, toValues;
 public:
     SnapshotArray(int length) {
         timestamp = 0;
     }
-    
+
     void set(int index, int val) {
         if (toSnaps.count(index) == 0) {
             // After lower_bound, prevent returning negative lo
@@ -16,18 +17,18 @@ class SnapshotArray {
         // same timestamp -> just update value
         if (toSnaps[index].back() == timestamp) {
             toValues[index].back() = val;
-        } 
+        }
         // not -> add timestamp and value
         else {
             toSnaps[index].push_back(timestamp);
             toValues[index].push_back(val);
         }
     }
-    
+
     int snap() {
         return timestamp++;
     }
-    
+
     int get(int index, int snap_id) {
         // check whether index exists or not
         if (toSnaps.count(index) == 0) return 0;
@@ -52,4 +53,4 @@ class SnapshotArray {
  * obj->set(index,val);
  * int param_2 = obj->snap();
  * int param_3 = obj->get(index,snap_id);
- */
+ */