Add one to linked list: done

Author: rampatra

src/main/java/com/ctci/linkedlists/DeleteMiddleNode.java

@@ -1,7 +1,5 @@
 package com.ctci.linkedlists;
 
-import static com.ctci.linkedlists.Node.printList;
-
 /**
  * @author rampatra
  * @since 2019-01-27
@@ -35,33 +33,33 @@ public static void main(String[] args) {
         l1.next.next.next = new Node(4);
         l1.next.next.next.next = new Node(5);
         l1.next.next.next.next.next = new Node(6);
-        printList(l1);
+        l1.print();
         deleteMiddleNode(l1.next.next);
-        printList(l1);
+        l1.print();
 
         System.out.println("----");
 
         l1 = new Node(1);
         l1.next = new Node(2);
         l1.next.next = new Node(3);
-        printList(l1);
+        l1.print();
         deleteMiddleNode(l1.next);
-        printList(l1);
+        l1.print();
 
         System.out.println("----");
 
         l1 = new Node(1);
         l1.next = new Node(3);
-        printList(l1);
+        l1.print();
         deleteMiddleNode(l1);
-        printList(l1);
+        l1.print();
 
         System.out.println("----");
 
         l1 = new Node(1);
         l1.next = new Node(3);
-        printList(l1);
+        l1.print();
         deleteMiddleNode(l1.next);
-        printList(l1);
+        l1.print();
     }
 }

src/main/java/com/ctci/linkedlists/Intersection.java

@@ -1,7 +1,5 @@
 package com.ctci.linkedlists;
 
-import static com.ctci.linkedlists.Node.printList;
-
 /**
  * @author rampatra
  * @since 2019-02-02
@@ -75,16 +73,16 @@ public static void main(String[] args) {
         l2.next.next = new Node(2);
         l2.next.next.next = new Node(3);
         l2.next.next.next.next = l1.next.next.next;
-        printList(l1);
-        printList(l2);
+        l1.print();
+        l2.print();
         System.out.println(findIntersectingNode(l1, l2).val); // may throw NPE, not handling for the sake of simplicity
 
         System.out.println("----");
 
         l1 = new Node(1);
         l2 = l1;
-        printList(l1);
-        printList(l2);
+        l1.print();
+        l2.print();
         System.out.println(findIntersectingNode(l1, l2).val); // may throw NPE, not handling for the sake of simplicity
 
         System.out.println("----");
@@ -99,8 +97,8 @@ public static void main(String[] args) {
         l2.next = new Node(4);
         l2.next.next = new Node(2);
         l2.next.next.next = new Node(3);
-        printList(l1);
-        printList(l2);
+        l1.print();
+        l2.print();
         System.out.println(findIntersectingNode(l1, l2));
     }
 }

src/main/java/com/ctci/linkedlists/KthToLastElement.java

@@ -1,7 +1,5 @@
 package com.ctci.linkedlists;
 
-import static com.ctci.linkedlists.Node.printList;
-
 /**
  * @author rampatra
  * @since 21/11/2018
@@ -60,7 +58,7 @@ public static void main(String[] args) {
         l1.next.next.next = new Node(4);
         l1.next.next.next.next = new Node(5);
         l1.next.next.next.next.next = new Node(7);
-        printList(l1);
+        l1.print();
         System.out.println("k=2: " + getKthToLastElement(l1, 2).val); // NPE check is omitted intentionally to keep it simple
         System.out.print("k=2: ");
         printKthToLastElement(l1, 2);
@@ -71,7 +69,7 @@ public static void main(String[] args) {
         l2.next.next.next = new Node(3);
         l2.next.next.next.next = new Node(4);
         l2.next.next.next.next.next = new Node(7);
-        printList(l2);
+        l2.print();
         System.out.println("k=1: " + getKthToLastElement(l2, 1).val);
         System.out.print("k=1: ");
         printKthToLastElement(l2, 1);
@@ -82,7 +80,7 @@ public static void main(String[] args) {
         l3.next.next.next = new Node(3);
         l3.next.next.next.next = new Node(4);
         l3.next.next.next.next.next = new Node(7);
-        printList(l3);
+        l3.print();
         System.out.println("k=6: " + getKthToLastElement(l3, 6).val);
         System.out.print("k=6: ");
         printKthToLastElement(l3, 6);

src/main/java/com/ctci/linkedlists/Node.java

@@ -12,10 +12,8 @@ class Node {
         this.val = val;
     }
 
-    public static void printList(Node head) {
-        if (head == null) return;
-
-        Node curr = head;
+    public void print() {
+        Node curr = this;
         while (curr.next != null) {
             System.out.print(curr.val + "->");
             curr = curr.next;

src/main/java/com/ctci/linkedlists/Palindrome.java

@@ -2,8 +2,6 @@
 
 import java.util.Stack;
 
-import static com.ctci.linkedlists.Node.printList;
-
 /**
  * @author rampatra
  * @since 2019-02-02
@@ -75,7 +73,7 @@ public static void main(String[] args) {
         l1.next.next.next = new Node(3);
         l1.next.next.next.next = new Node(2);
         l1.next.next.next.next.next = new Node(1);
-        printList(l1);
+        l1.print();
         System.out.println(isPalindrome(l1));
         System.out.println(isPalindromeOptimized(l1));
         System.out.println("------");
@@ -85,7 +83,7 @@ public static void main(String[] args) {
         l1.next.next = new Node(3);
         l1.next.next.next = new Node(2);
         l1.next.next.next.next = new Node(1);
-        printList(l1);
+        l1.print();
         System.out.println(isPalindrome(l1));
         System.out.println(isPalindromeOptimized(l1));
         System.out.println("------");
@@ -95,13 +93,13 @@ public static void main(String[] args) {
         l1.next.next = new Node(3);
         l1.next.next.next = new Node(3);
         l1.next.next.next.next = new Node(0);
-        printList(l1);
+        l1.print();
         System.out.println(isPalindrome(l1));
         System.out.println(isPalindromeOptimized(l1));
         System.out.println("------");
 
         l1 = new Node(1);
-        printList(l1);
+        l1.print();
         System.out.println(isPalindrome(l1));
         System.out.println(isPalindromeOptimized(l1));
 

src/main/java/com/ctci/linkedlists/Partition.java

@@ -1,7 +1,5 @@
 package com.ctci.linkedlists;
 
-import static com.ctci.linkedlists.Node.printList;
-
 /**
  * Write code to partition a linked list around a value x, such that all nodes less than x come before all
  * nodes greater than or equal to x. If x is contained within the list, the values of x only need to be
@@ -59,36 +57,36 @@ public static void main(String[] args) {
         l1.next.next.next.next = new Node(10);
         l1.next.next.next.next.next = new Node(2);
         l1.next.next.next.next.next.next = new Node(1);
-        printList(l1);
-        printList(partition(l1, 5));
+        l1.print();
+        l1.print();
 
         System.out.println("----");
 
         l1 = new Node(1);
         l1.next = new Node(2);
         l1.next.next = new Node(3);
-        printList(l1);
-        printList(partition(l1, 2));
+        l1.print();
+        l1.print();
 
         System.out.println("----");
 
         l1 = new Node(3);
         l1.next = new Node(2);
         l1.next.next = new Node(1);
-        printList(l1);
-        printList(partition(l1, 2));
+        l1.print();
+        l1.print();
 
         System.out.println("----");
 
         l1 = new Node(1);
-        printList(l1);
-        printList(partition(l1, 1));
+        l1.print();
+        l1.print();
 
         System.out.println("----");
 
         l1 = null;
-        printList(l1);
-        printList(partition(l1, 1));
+        l1.print();
+        l1.print();
 
         System.out.println("----");
     }

src/main/java/com/ctci/linkedlists/RemoveDuplicates.java

@@ -3,8 +3,6 @@
 import java.util.HashSet;
 import java.util.Set;
 
-import static com.ctci.linkedlists.Node.printList;
-
 /**
  * @author rampatra
  * @since 21/11/2018
@@ -44,10 +42,10 @@ public static void main(String[] args) {
         l1.next.next.next.next = new Node(5);
         l1.next.next.next.next.next = new Node(5);
         System.out.print("With dups: ");
-        printList(l1);
+        l1.print();
         removeDuplicatesFromUnsortedList(l1);
         System.out.print("Without dups: ");
-        printList(l1);
+        l1.print();
 
         Node l2 = new Node(1);
         l2.next = new Node(1);
@@ -56,10 +54,10 @@ public static void main(String[] args) {
         l2.next.next.next.next = new Node(4);
         l2.next.next.next.next.next = new Node(5);
         System.out.print("\nWith dups: ");
-        printList(l2);
+        l2.print();
         removeDuplicatesFromUnsortedList(l2);
         System.out.print("Without dups: ");
-        printList(l2);
+        l2.print();
 
         Node l3 = new Node(1);
         l3.next = new Node(2);
@@ -68,23 +66,23 @@ public static void main(String[] args) {
         l3.next.next.next.next = new Node(4);
         l3.next.next.next.next.next = new Node(5);
         System.out.print("\nWith dups: ");
-        printList(l3);
+        l3.print();
         removeDuplicatesFromUnsortedList(l3);
         System.out.print("Without dups: ");
-        printList(l3);
-        
+        l3.print();
+
         Node l4 = new Node(1);
         System.out.print("\nWith dups: ");
-        printList(l4);
+        l4.print();
         removeDuplicatesFromUnsortedList(l4);
         System.out.print("Without dups: ");
-        printList(l4);
+        l4.print();
 
         Node l5 = null;
         System.out.print("\nWith dups: ");
-        printList(l5);
+        l5.print();
         removeDuplicatesFromUnsortedList(l5);
         System.out.print("Without dups: ");
-        printList(l5);
+        l5.print();
     }
 }

src/main/java/com/ctci/linkedlists/SumLists.java

@@ -1,7 +1,5 @@
 package com.ctci.linkedlists;
 
-import static com.ctci.linkedlists.Node.printList;
-
 /**
  * @author rampatra
  * @since 2019-01-31
@@ -59,9 +57,9 @@ public static void main(String[] args) {
         l2.next = new Node(9);
         l2.next.next = new Node(9);
 
-        printList(l1);
-        printList(l2);
-        printList(sumLists(l1, l2));
+        l1.print();
+        l2.print();
+        sumLists(l1, l2).print();
         System.out.println("-----------");
 
         l1 = new Node(9);
@@ -71,18 +69,18 @@ public static void main(String[] args) {
         l2.next = new Node(9);
         l2.next.next = new Node(9);
 
-        printList(l1);
-        printList(l2);
-        printList(sumLists(l1, l2));
+        l1.print();
+        l2.print();
+        sumLists(l1, l2).print();
         System.out.println("-----------");
 
         l1 = null;
         l2 = new Node(9);
         l2.next = new Node(9);
         l2.next.next = new Node(8);
 
-        printList(l1);
-        printList(l2);
-        printList(sumLists(l1, l2));
+        l1.print();
+        l2.print();
+        sumLists(l1, l2).print();
     }
 }