add 1439

fishercoder1534 · fishercoder1534 · commit a464cde48cd8 · 2021-11-02T12:14:43.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1439.java b/src/main/java/com/fishercoder/solutions/_1439.java
@@ -13,6 +13,8 @@ public static class Solution1 {
          * 2. priority queue doesn't help in this case unless used in combination with a set to filter out duplicates;
          * 3. implement a customized comparator for treeset: if sum i.e. entry[0] doesn't equal, then it's not a duplicate,
          * then we compare the rest of the elements in the array, as long as anyone of them differs at the same index, it's not a duplicate.
+         *
+         * Again, using a pen and paper to visualize my thought process helps a lot!
          */
         public int kthSmallest(int[][] mat, int k) {
             TreeSet<int[]> treeSet = new TreeSet<>(new Comparator<int[]>() {
