Prepare for publication

Author: spannm

.gitignore

@@ -14,3 +14,4 @@
 .~lock*
 *.kate-swp
 **/Migrate*.java
+**/RenameMethodParms.java

src/main/java/io/github/spannm/leetcode/LeetcodeProblem.java

@@ -2,35 +2,9 @@
 
 public abstract class LeetcodeProblem {
 
-    private final boolean doOutput;
-
-    protected LeetcodeProblem() {
-        this(true);
-    }
-
-    protected LeetcodeProblem(boolean _doOutput) {
-        doOutput = _doOutput;
-    }
-
-    public final boolean doOutput() {
-        return doOutput;
-    }
-
-    public final void printf(String _format, Object... _args) {
-        if (doOutput) {
-            System.out.printf(_format, _args);
-        }
-    }
-
-    public final void println(Object _arg) {
-        if (doOutput) {
-            System.out.println(_arg);
-        }
-    }
-
     @Override
     public String toString() {
-        return getClass().getSimpleName() + "[]";
+        return String.format("%s[]", getClass().getSimpleName());
     }
 
     public static String asString(Object _o) {

src/main/java/io/github/spannm/leetcode/LeetcodeSqlProblem.java

@@ -5,7 +5,6 @@ public abstract class LeetcodeSqlProblem extends LeetcodeProblem {
     private final String sql;
 
     protected LeetcodeSqlProblem(String _sql) {
-        super(true);
         sql = _sql;
     }
 

src/main/java/io/github/spannm/leetcode/dep/Sudoku.java

@@ -37,12 +37,7 @@ public boolean solve(Board _board) {
 
                 List<Field> fields = _board.boxes.stream().flatMap(b -> b.getFields().stream()).toList();
 
-                // inspect field by field
-                for (Field currFld : fields) {
-                    // if (currFld.getRowNo() == 'A' && currFld.getColNo() == 1) {
-                    // doOutput(" DEBUG ");
-                    // }
-                    // doOutput(" %s%n", currFld);
+                for (Field currFld : fields) { // inspect field by field
 
                     // check all remaining possible values whether one is only possible in this field
                     for (Area area : currFld.getAreas()) {

src/main/java/io/github/spannm/leetcode/lc0/lc0000/Problem0001.java

@@ -2,31 +2,23 @@
 
 import io.github.spannm.leetcode.LeetcodeProblem;
 
+import java.util.ArrayList;
+import java.util.List;
+
 /**
  * <a href="https://leetcode.com/problems/two-sum/">1. Two Sum</a>.
  */
 class Problem0001 extends LeetcodeProblem {
 
     int[] twoSum(int[] _nums, int _target) {
-        if (doOutput()) {
-            printf("Input: %s, target: %d%n", java.util.Arrays.toString(_nums), _target);
-        }
-        return impl1(_nums, _target);
-    }
-
-    int[] impl1(int[] _nums, int _target) {
-        final java.util.List<IdxAndNum> idxAndNums = new java.util.ArrayList<>();
+        List<IdxAndNum> idxAndNums = new ArrayList<>();
         for (int i = 0; i < _nums.length; i++) {
             idxAndNums.add(new IdxAndNum(i, _nums[i]));
         }
         idxAndNums.sort(java.util.Comparator.comparing(IdxAndNum::getNum).thenComparing(IdxAndNum::getIdx));
 
         final int len = idxAndNums.size();
 
-        if (doOutput()) {
-            printf("Values (%s): %s%n", len, idxAndNums);
-        }
-
         int[] result = null;
 
         for (int i1 = 0; i1 < len - 1; i1++) {
@@ -40,19 +32,14 @@ int[] impl1(int[] _nums, int _target) {
 
         }
 
-        System.err.printf("No result found! %n%n");
         return null;
     }
 
     /**
      * Calculates the sum of two values.<br>
      * If equal to {@code target}, returns their indices in an int array.
      */
-    int[] calcSum(IdxAndNum _in1, IdxAndNum _in2, int _target) {
-        if (doOutput()) {
-            printf("  Test %s + %s = %s %n%n", _in1, _in2, _target);
-        }
-
+    static int[] calcSum(IdxAndNum _in1, IdxAndNum _in2, int _target) {
         if (_in1.getNum() + _in2.getNum() == _target) {
             return new int[] {_in1.getIdx(), _in2.getIdx()};
         }

src/main/java/io/github/spannm/leetcode/lc0/lc0000/Problem0004.java

@@ -13,20 +13,18 @@
 class Problem0004 extends LeetcodeProblem {
 
     double findMedianSortedArrays(int[] _nums1, int[] _nums2) {
-        final LinkedList<Integer> l1 = Arrays.stream(_nums1).boxed().collect(Collectors.toCollection(LinkedList::new));
-        final LinkedList<Integer> l2 = Arrays.stream(_nums2).boxed().collect(Collectors.toCollection(LinkedList::new));
+        LinkedList<Integer> l1 = Arrays.stream(_nums1).boxed().collect(Collectors.toCollection(LinkedList::new));
+        LinkedList<Integer> l2 = Arrays.stream(_nums2).boxed().collect(Collectors.toCollection(LinkedList::new));
 
         // merge sorted arrays into one
         final LinkedList<Integer> merged = new LinkedList<>();
-        // Solange noch nicht beide Listen hinzugefügt worden
         while (!l1.isEmpty() && !l2.isEmpty()) {
             if (l1.getFirst() <= l2.getFirst()) {
                 merged.addLast(l1.removeFirst());
             } else {
                 merged.addLast(l2.removeFirst());
             }
         }
-        // Füge Rest hinzu, falls etwas übrig ist.
         merged.addAll(l1);
         merged.addAll(l2);
 
@@ -46,15 +44,9 @@ List<Integer> merge(LinkedList<Integer> _l1, LinkedList<Integer> _l2) {
                 merged.addLast(_l2.removeFirst());
             }
         }
-        // Füge Rest hinzu, falls etwas übrig ist.
         merged.addAll(_l1);
         merged.addAll(_l2);
         return merged;
     }
 
-    public void printFindMedianSortedArrays(int[] _nums1, int[] _nums2) {
-        double result = findMedianSortedArrays(_nums1, _nums2);
-        printf("%s and %s => %s%n", asString(_nums1), asString(_nums2), result);
-    }
-
 }

src/main/java/io/github/spannm/leetcode/lc0/lc0000/Problem0006.java

@@ -23,7 +23,6 @@ String convert(String _s, int _numRows) {
 
         for (int i = 0; i < arr.length; i++) {
             sbs.get(z).append(arr[i]);
-            printf("i=%s, z=%s, v=%s %s %n", i, z, arr[i], up ? "up" : "down");
             if (up) {
                 z++;
             } else {
@@ -34,10 +33,6 @@ String convert(String _s, int _numRows) {
             }
         }
 
-        if (doOutput()) {
-            sbs.forEach(this::println);
-        }
-
         return sbs.stream().map(StringBuilder::toString).collect(Collectors.joining(""));
     }
 

src/main/java/io/github/spannm/leetcode/lc0/lc0000/Problem0008.java

@@ -5,7 +5,6 @@
 class Problem0008 extends LeetcodeProblem {
 
     int myAtoi(String _s) {
-        printf("Input: %s %n", _s);
         if (_s == null || _s.isEmpty()) {
             return 0;
         }

src/main/java/io/github/spannm/leetcode/lc0/lc0000/Problem0017.java

@@ -68,7 +68,6 @@ public List<String> letterCombinations2(String _digits) {
         Set<String> combinations = new LinkedHashSet<>();
 
         generatePermutations(lol, combinations, 0, "");
-        printf("Combinations: %s %n", combinations);
 
         return new ArrayList<>(combinations);
     }

src/main/java/io/github/spannm/leetcode/lc0/lc0000/Problem0019.java

@@ -9,7 +9,6 @@
 class Problem0019 extends LeetcodeProblem {
 
     ListNode removeNthFromEnd(ListNode _head, int _n) {
-        printf("Input: %s, n=%d%n", _head, _n);
         ListNode node = _head;
 
         int count = 1;
@@ -25,7 +24,6 @@ ListNode removeNthFromEnd(ListNode _head, int _n) {
         }
 
         int position = count - _n + 1; // position to remove
-        printf("Position of node to remove: %d (%d from end)%n", position, _n);
         if (position == 1) {
             _head = _head.next;
             return _head;