Time: 0 ms (100.00%), Space: 44.4 MB (100.00%) - LeetHub

py3-coder · py3-coder · commit 76f4e44cffff · 2024-12-16T13:03:07.000+05:30
diff --git a/3386-button-with-longest-push-time/3386-button-with-longest-push-time.java b/3386-button-with-longest-push-time/3386-button-with-longest-push-time.java
@@ -1,12 +1,30 @@
 class Solution {
+    // public int buttonWithLongestTime(int[][] events) {
+           // TC : nlogn
+           // SC : n
+    //     PriorityQueue<int[]> pq = new PriorityQueue<>((a,b)->(a[0]==b[0] ? a[1]-b[1] : b[0]-a[0]));
+    //     pq.offer(new int[]{events[0][1] , events[0][0]});
+    //     for(int i=1;i<events.length;i++){
+    //         int diff = events[i][1] -  events[i-1][1];
+    //         pq.offer(new int[]{diff , events[i][0]});
+    //     }
+    //     int[] res = pq.peek();
+    //     return res[1];
+    // }
     public int buttonWithLongestTime(int[][] events) {
-        PriorityQueue<int[]> pq = new PriorityQueue<>((a,b)->(a[0]==b[0] ? a[1]-b[1] : b[0]-a[0]));
-        pq.offer(new int[]{events[0][1] , events[0][0]});
-        for(int i=1;i<events.length;i++){
-            int diff = events[i][1] -  events[i-1][1];
-            pq.offer(new int[]{diff , events[i][0]});
+        // 
+        int longest = events[0][1];
+        int ans = events[0][0];
+
+        for (int i = 1; i < events.length; i++) {
+             int delta = events[i][1] - events[i - 1][1];
+             int index = events[i][0];
+            if (delta > longest || delta == longest && index < ans) {
+                longest = delta;
+                ans = index;
+            }
         }
-        int[] res = pq.peek();
-        return res[1];
+
+        return ans;
     }
 }
