Runtime: 526 ms (Top 46.46%) | Memory: 54.8 MB (Top 85.59%)

Author: AnasImloul

scripts/algorithms/Q/Query Kth Smallest Trimmed Number/Query Kth Smallest Trimmed Number.java

@@ -1,3 +1,4 @@
+// Runtime: 526 ms (Top 46.46%) | Memory: 54.8 MB (Top 85.59%)
 class Solution {
     public int[] smallestTrimmedNumbers(String[] nums, int[][] queries) {
 
@@ -7,7 +8,7 @@ public int[] smallestTrimmedNumbers(String[] nums, int[][] queries) {
         int[] result = new int[queries.length];
         int strLen = nums[0].length();
         int[] index = new int[1];
-		
+
         PriorityQueue<Integer> queue = new PriorityQueue<>((a, b) -> {
             for (int i = index[0]; i < strLen; i++) {
                 if (nums[a].charAt(i) != nums[b].charAt(i))
@@ -32,4 +33,4 @@ public int[] smallestTrimmedNumbers(String[] nums, int[][] queries) {
 
         return result;
     }
-}
+}