add 1629

fishercoder1534 · fishercoder1534 · commit 8c3647bec40b · 2020-10-28T06:37:03.000-07:00
diff --git a/README.md b/README.md
@@ -9,6 +9,7 @@ _If you like this project, please leave me a star._ &#9733;
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
 |1630|[Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1630.java) ||Medium|Sort|
+|1629|[Slowest Key](https://leetcode.com/problems/slowest-key/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1629.java) ||Easy|Array|
 |1626|[Best Team With No Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1626.java) ||Medium|DP|
 |1625|[Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1625.java) ||Medium|BFS, DFS|
 |1624|[Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1624.java) ||Easy|String|
diff --git a/src/main/java/com/fishercoder/solutions/_1629.java b/src/main/java/com/fishercoder/solutions/_1629.java
@@ -0,0 +1,48 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+public class _1629 {
+    public static class Solution1 {
+        public char slowestKey(int[] releaseTimes, String keysPressed) {
+            Map<Character, Integer> map = new HashMap<>();
+            for (int i = 0; i < releaseTimes.length; i++) {
+                char c = keysPressed.charAt(i);
+                int duration;
+                if (i == 0) {
+                    duration = releaseTimes[i];
+                } else {
+                    duration = releaseTimes[i] - releaseTimes[i - 1];
+                }
+                if (!map.containsKey(c)) {
+                    map.put(c, duration);
+                } else {
+                    int val = map.get(c);
+                    if (duration > val) {
+                        map.put(c, duration);
+                    }
+                }
+            }
+            Map<Integer, List<Character>> map2 = new HashMap<>();
+            for (char c : map.keySet()) {
+                int duration = map.get(c);
+                if (!map2.containsKey(duration)) {
+                    map2.put(duration, new ArrayList<>());
+                }
+                map2.get(duration).add(c);
+            }
+            int max = -1;
+            for (int duration : map2.keySet()) {
+                List<Character> chars = map2.get(duration);
+                Collections.sort(chars);
+                map2.put(duration, chars);
+                max = Math.max(max, duration);
+            }
+            return map2.get(max).get(map2.get(max).size() - 1);
+        }
+    }
+}
