refactor 237

fishercoder1534 · fishercoder1534 · commit 7978d30300c1 · 2020-01-12T15:10:18.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_237.java b/src/main/java/com/fishercoder/solutions/_237.java
@@ -6,8 +6,24 @@
  * 237. Delete Node in a Linked List
  * 
  * Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
- * Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3,
- * the linked list should become 1 -> 2 -> 4 after calling your function.
+ *
+ * Given linked list -- head = [4,5,1,9], which looks like following:
+ *
+ * Example 1:
+ * Input: head = [4,5,1,9], node = 5
+ * Output: [4,1,9]
+ * Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
+ *
+ * Example 2:
+ * Input: head = [4,5,1,9], node = 1
+ * Output: [4,5,9]
+ * Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
+ *
+ * Note:
+ * The linked list will have at least two elements.
+ * All of the nodes' values will be unique.
+ * The given node will not be the tail and it will always be a valid node of the linked list.
+ * Do not return anything from your function.
 */
 public class _237 {
 
diff --git a/src/test/java/com/fishercoder/_237Test.java b/src/test/java/com/fishercoder/_237Test.java
@@ -0,0 +1,28 @@
+package com.fishercoder;
+
+import com.fishercoder.common.classes.ListNode;
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._237;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+public class _237Test {
+    private static _237.Solution1 solution1;
+    private static ListNode head;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _237.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        head = ListNode.createSinglyLinkedList(Arrays.asList(4, 5, 1, 9));
+        CommonUtils.printList(head);
+        solution1.deleteNode(head.next);
+        CommonUtils.printList(head);
+    }
+
+}
