update

OneCodeMonkey · OneCodeMonkey · commit 2a3d2d430bea · 2025-06-15T11:58:53.000+08:00
diff --git a/leetcode_solved/leetcode_3567_Minimum_Absolute_Difference_in_Sliding_Submatrix.java b/leetcode_solved/leetcode_3567_Minimum_Absolute_Difference_in_Sliding_Submatrix.java
@@ -0,0 +1,34 @@
+// Runtime 27 ms Beats 56.93% 
+// Memory 45.76 MB Beats 54.10%
+// Brute-force & sort.
+// T:O(m*n*k^2*log(k^2)), S:O(m*n)
+//
+class Solution {
+    public int[][] minAbsDiff(int[][] grid, int k) {
+        int row = grid.length, col = grid[0].length, row1 = row - k + 1, col1 = col - k + 1;
+        int[][] ret = new int[row1][col1];
+        if (k == 1) {
+            return ret;
+        }
+        for (int i = 0; i < row1; i++) {
+            for (int j = 0; j < col1; j++) {
+                int ans = Integer.MAX_VALUE;
+                List<Integer> tmp = new ArrayList<>();
+                for (int r = i; r < i + k; r++) {
+                    for (int t = j; t < j + k; t++) {
+                        tmp.add(grid[r][t]);
+                    }
+                }
+                tmp.sort(Comparator.naturalOrder());
+                for (int r = 0; r < tmp.size() - 1; r++) {
+                    if (!tmp.get(r).equals(tmp.get(r + 1))) {
+                        ans = Math.min(ans, Math.abs(tmp.get(r) - tmp.get(r + 1)));
+                    }
+                }
+                ret[i][j] = ans == Integer.MAX_VALUE ? 0 : ans;
+            }
+        }
+
+        return ret;
+    }
+}
diff --git a/leetcode_solved/leetcode_3572_Maximize_Y_Sum_by_Picking_a_Triplet_of_Distinct_X_Values.java b/leetcode_solved/leetcode_3572_Maximize_Y_Sum_by_Picking_a_Triplet_of_Distinct_X_Values.java
@@ -0,0 +1,27 @@
+// Runtime 105 ms Beats 100.00% 
+// Memory 61.61 MB Beats 100.00%
+// Sort & greedy
+// T:O(n), S:O(nlogn)
+// 
+class Solution {
+    public int maxSumDistinctTriplet(int[] x, int[] y) {
+        HashMap<Integer, Integer> record = new HashMap<>();
+        int len = x.length;
+        for (int i = 0; i < len; i++) {
+            if (record.containsKey(x[i]) && record.get(x[i]) >= y[i]) {
+                continue;
+            }
+            record.put(x[i], y[i]);
+        }
+        if (record.size() < 3) {
+            return -1;
+        }
+        List<Integer> vals = new ArrayList<>();
+        for (int key : record.keySet()) {
+            vals.add(record.get(key));
+        }
+        vals.sort(Collections.reverseOrder());
+
+        return vals.get(0) + vals.get(1) + vals.get(2);
+    }
+}
