Added Partition Linked list - Medium

MichaelVandi · MichaelVandi · commit 460409257615 · 2020-09-24T13:38:47.000-04:00
diff --git a/CrackingTheCodingInterview/LinkedListSolutions/partition_linked_list.java b/CrackingTheCodingInterview/LinkedListSolutions/partition_linked_list.java
@@ -14,7 +14,7 @@ public ListNode partition(ListNode node, int x) {
     while (node != null) {
         // Let us insert into the before and after lists
         ListNode next = node.next;
-        node.next = null; // ??
+        node.next = null; // Cut off the connection to the other nodes
         if (node.val < x) {
             // Insert into before list
             if (beforeStart == null) {
@@ -34,7 +34,7 @@ public ListNode partition(ListNode node, int x) {
                 afterEnd = node;
             }
         }
-        node = node.next;
+        node = next;
     }
     // Now we check if our before list == null, meaning we only
     // Have nodes that are greater so we return after

Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,7 @@ public ListNode partition(ListNode node, int x) {`
`14`	`14`	`while (node != null) {`
`15`	`15`	`// Let us insert into the before and after lists`
`16`	`16`	`ListNode next = node.next;`
`17`		`- node.next = null; // ??`
	`17`	`+ node.next = null; // Cut off the connection to the other nodes`
`18`	`18`	`if (node.val < x) {`
`19`	`19`	`// Insert into before list`
`20`	`20`	`if (beforeStart == null) {`
`@@ -34,7 +34,7 @@ public ListNode partition(ListNode node, int x) {`
`34`	`34`	`afterEnd = node;`
`35`	`35`	`}`
`36`	`36`	`}`
`37`		`- node = node.next;`
	`37`	`+ node = next;`
`38`	`38`	`}`
`39`	`39`	`// Now we check if our before list == null, meaning we only`
`40`	`40`	`// Have nodes that are greater so we return after`