package com.fishercoder.solutions;

import com.fishercoder.common.classes.ListNode;

/**
 * 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.
*/
public class _237 {

    public void deleteNode(ListNode node) {
        node.val = node.next.val;
        node.next = node.next.next;
    }

}

@@ -436,16 +436,57 @@
 37 %7B%0D%0A%0D%0A
+    public static class Solution1 %7B%0D%0A    
     publ
@@ -526,24 +526,28 @@
  %7B%0D%0A        
+   
+ 
 node.val = n
@@ -561,16 +561,20 @@
 t.val;%0D%0A
+    
         
@@ -606,16 +606,25 @@
 t;%0D%0A    
+  
+  
 %7D%0D%0A
+    %7D
 %0D%0A%7D%0D%0A

refactor 237