Time: 4 ms (16.55%), Space: 45.4 MB (7.02%) - LeetHub

py3-coder · py3-coder · commit ece5cc786380 · 2024-12-16T12:01:47.000+05:30
diff --git a/3264-final-array-state-after-k-multiplication-operations-i/3264-final-array-state-after-k-multiplication-operations-i.java b/3264-final-array-state-after-k-multiplication-operations-i/3264-final-array-state-after-k-multiplication-operations-i.java
@@ -0,0 +1,23 @@
+class Solution {
+    public int[] getFinalState(int[] nums, int k, int multiplier) {
+        // PQ 
+        // TC : O(nlogn+klogn)
+        // SC :O(n)
+        
+        PriorityQueue<int[]> pq = new PriorityQueue<>((a,b)->(a[0]==b[0] ? a[1]-b[1] : a[0]-b[0]));
+        for(int i=0;i<nums.length;i++){
+            pq.offer(new int[]{nums[i],i});
+        }
+        while(k-->0){
+            int[] pp = pq.poll();
+            pp[0]*=multiplier;
+            pq.offer(pp);
+        }
+        int[] res = new int[nums.length];
+        while(!pq.isEmpty()){
+            int[] pair = pq.poll();
+            res[pair[1]] = pair[0];
+        }
+        return res;
+    }
+}
