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.
 *
 * 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 {

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

@@ -86,919 +86,8 @@
 %0D%0A%0D%0A
-/**%0D%0A * 237. Delete Node in a Linked List%0D%0A * %0D%0A * Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.%0D%0A *%0D%0A * Given linked list -- head = %5B4,5,1,9%5D, which looks like following:%0D%0A *%0D%0A * Example 1:%0D%0A * Input: head = %5B4,5,1,9%5D, node = 5%0D%0A * Output: %5B4,1,9%5D%0D%0A * Explanation: You are given the second node with value 5, the linked list should become 4 -%3E 1 -%3E 9 after calling your function.%0D%0A *%0D%0A * Example 2:%0D%0A * Input: head = %5B4,5,1,9%5D, node = 1%0D%0A * Output: %5B4,5,9%5D%0D%0A * Explanation: You are given the third node with value 1, the linked list should become 4 -%3E 5 -%3E 9 after calling your function.%0D%0A *%0D%0A * Note:%0D%0A * The linked list will have at least two elements.%0D%0A * All of the nodes' values will be unique.%0D%0A * The given node will not be the tail and it will always be a valid node of the linked list.%0D%0A * Do not return anything from your function.%0D%0A*/%0D%0A
 publ

refactor 237