[LEET-3386] add 3386

fishercoder1534 · fishercoder1534 · commit 0d31b5ae998c · 2025-01-26T15:56:31.000-08:00
diff --git a/paginated_contents/algorithms/4th_thousand/README.md b/paginated_contents/algorithms/4th_thousand/README.md
@@ -2,6 +2,7 @@
 |------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------
 | 3396 | [Minimum Number of Operations to Make Elements in Array Distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3396.java) |                                                                               | Easy       |
 | 3392 | [Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3392.java) |                                                                               | Easy       |
+| 3386 | [Button with Longest Push Time](https://leetcode.com/problems/button-with-longest-push-time/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3386.java) |                                                                               | Easy       |
 | 3379 | [Transformed Array](https://leetcode.com/problems/transformed-array/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3379.java) |                                                                               | Easy       |
 | 3375 | [Minimum Operations to Make Array Values Equal to K](https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3375.java) |                                                                               | Easy       |
 | 3370 | [Smallest Number With All Set Bits](https://leetcode.com/problems/smallest-number-with-all-set-bits/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3370.java) |                                                                               | Easy       |
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3386.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3386.java
@@ -0,0 +1,32 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _3386 {
+    public static class Solution1 {
+        public int buttonWithLongestTime(int[][] events) {
+            Map<Integer, Integer> map = new HashMap<>();
+            int ans = events[0][0];
+            map.put(events[0][0], events[0][1]);
+            for (int i = 1; i < events.length; i++) {
+                int duration = events[i][1] - events[i - 1][1];
+                if (map.getOrDefault(events[i][0], 0) < duration) {
+                    map.put(events[i][0], duration);
+                }
+            }
+            int maxDuration = events[0][1];
+            for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+                if (entry.getValue() > maxDuration) {
+                    ans = entry.getKey();
+                    maxDuration = entry.getValue();
+                } else if (entry.getValue() == maxDuration) {
+                    if (entry.getKey() < ans) {
+                        ans = entry.getKey();
+                    }
+                }
+            }
+            return ans;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3386Test.java b/src/test/java/com/fishercoder/fourththousand/_3386Test.java
@@ -0,0 +1,53 @@
+package com.fishercoder.fourththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions.fourththousand._3386;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _3386Test {
+    private _3386.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3386.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(
+                1,
+                solution1.buttonWithLongestTime(
+                        CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                                "[1,2],[2,5],[3,9],[1,15]")));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(
+                2,
+                solution1.buttonWithLongestTime(
+                        CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                                "[9,4],[19,5],[2,8],[3,11],[2,15]")));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(
+                2,
+                solution1.buttonWithLongestTime(
+                        CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                                "[7,1],[19,3],[9,4],[12,5],[2,8],[15,10],[18,12],[7,14],[19,16]")));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(
+                16,
+                solution1.buttonWithLongestTime(
+                        CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                                "[5,5],[16,17],[16,19]")));
+    }
+}
