add 2034

fishercoder1534 · fishercoder1534 · commit 7606fbde70ca · 2021-10-09T21:23:16.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2034|[Stock Price Fluctuation](https://leetcode.com/problems/stock-price-fluctuation/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2034.java) ||Medium||
 |2033|[Minimum Operations to Make a Uni-Value Grid](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2033.java) ||Medium||
 |2032|[Two Out of Three](https://leetcode.com/problems/two-out-of-three/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2032.java) ||Easy||
 |2028|[Find Missing Observations](https://leetcode.com/problems/find-missing-observations/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2028.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2034.java b/src/main/java/com/fishercoder/solutions/_2034.java
@@ -0,0 +1,52 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.TreeSet;
+
+public class _2034 {
+    public static class Solution1 {
+        class StockPrice {
+            TreeSet<Integer> treeSet;
+            Map<Integer, Integer> map;
+            Map<Integer, Integer> countMap;
+            int current;
+
+            public StockPrice() {
+                treeSet = new TreeSet<>();
+                map = new HashMap<>();
+                countMap = new HashMap<>();
+                current = 0;
+            }
+
+            public void update(int timestamp, int price) {
+                if (map.containsKey(timestamp)) {
+                    int previousPrice = map.get(timestamp);
+                    countMap.put(previousPrice, countMap.getOrDefault(previousPrice, 0) - 1);
+                    if (countMap.get(previousPrice) <= 0) {
+                        countMap.remove(previousPrice);
+                        treeSet.remove(previousPrice);
+                    }
+                }
+                map.put(timestamp, price);
+                treeSet.add(price);
+                countMap.put(price, countMap.getOrDefault(price, 0) + 1);
+                if (current < timestamp) {
+                    current = timestamp;
+                }
+            }
+
+            public int current() {
+                return map.get(current);
+            }
+
+            public int maximum() {
+                return treeSet.last();
+            }
+
+            public int minimum() {
+                return treeSet.first();
+            }
+        }
+    }
+}
