refactor 19

fishercoder1534 · fishercoder1534 · commit 011b39376526 · 2020-01-12T21:28:23.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_19.java b/src/main/java/com/fishercoder/solutions/_19.java
@@ -10,7 +10,6 @@
  * After removing the second node from the end, the linked list becomes 1->2->3->5.
 
 Note:
-
 Given n will always be valid.
 Try to do this in one pass.
  */
diff --git a/src/test/java/com/fishercoder/_19Test.java b/src/test/java/com/fishercoder/_19Test.java
@@ -10,12 +10,14 @@
 
 public class _19Test {
     private static _19.Solution1 solution1;
+    private static _19.Solution3 solution3;
     private static ListNode head;
     private static ListNode expected;
 
     @BeforeClass
     public static void setup() {
         solution1 = new _19.Solution1();
+        solution3 = new _19.Solution3();
     }
 
     @Test
@@ -25,4 +27,18 @@ public void test1() {
         assertEquals(expected, solution1.removeNthFromEnd(head, 2));
     }
 
+    @Test
+    public void test2() {
+        head = LinkedListUtils.contructLinkedList(new int[]{1, 2, 3, 4, 5});
+        expected = LinkedListUtils.contructLinkedList(new int[]{1, 2, 3, 5});
+        assertEquals(expected, solution3.removeNthFromEnd(head, 2));
+    }
+
+    @Test
+    public void test3() {
+        head = LinkedListUtils.contructLinkedList(new int[]{1});
+        expected = LinkedListUtils.contructLinkedList(new int[]{});
+        assertEquals(expected, solution1.removeNthFromEnd(head, 1));
+    }
+
 }
