some extra notes on remove linked list elements

fishercoder1534 · fishercoder1534 · commit 0f351babccff · 2016-08-05T10:14:24.000-07:00
diff --git a/EASY/src/easy/RemoveLinkedListElements.java b/EASY/src/easy/RemoveLinkedListElements.java
@@ -19,7 +19,12 @@ public class RemoveLinkedListElements {
 	 * 1. Eventually, we should return dummy.next as the final result.
 	 * 2. we assign head to curr, dummy to prev
 	 * 3. and then we use prev and curr to traverse through the list and do the work
-	 * 4. each time, we only move one node forward, so we don't need another while loop inside the while loop*/
+	 * 4. each time, we only move one node forward, so we don't need another while loop inside the while loop
+	 * 5. KEY: if(curr.val == val), then curr is the node we want to remove, so, we'll assign curr.next to prev.next, thus, prev won't have that node
+	 * 		else, we'll keep moving prev forward, so, just do prev = prev.next
+	 * 		but, for both cases, we'll also move curr forward, so we put curr = curr.next in the outside.
+	 * 
+	 * */
 	public ListNode removeElements(ListNode head, int val) {
 		ListNode dummy = new ListNode(-1);
 		dummy.next = head;
@@ -37,8 +42,14 @@ public ListNode removeElements(ListNode head, int val) {
 	
 	public static void main(String...strings){
 		RemoveLinkedListElements test = new RemoveLinkedListElements();
-		int val = 1;
+		int val = 6;
 		ListNode head = new ListNode(1);
+		head.next = new ListNode(2);
+		head.next.next = new ListNode(6);
+		head.next.next.next = new ListNode(3);
+		head.next.next.next.next = new ListNode(4);
+		head.next.next.next.next.next = new ListNode(5);
+		head.next.next.next.next.next.next = new ListNode(6);
 		ListNode res = test.removeElements(head, val);
 		CommonUtils.printList(res);
 	}
