@@ -0,0 +1,689 @@
+/**%0A * Author : Laberat%0A * Date   : 16/2/2.%0A * Link   : https://leetcode.com/problems/delete-node-in-a-linked-list/%0A * Number : # 237%0A * Desc   : Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.%0A *          Supposed the linked list is 1 -%3E 2 -%3E 3 -%3E 4 and you are given the third node with value 3,%0A *          the linked list should become 1 -%3E 2 -%3E 4 after calling your function.%0A */%0Apublic class DelNodeInALinkedList %7B%0A    public void deleteNode(ListNode node) %7B%0A        node.val = node.next.val;%0A        node.next = node.next.next;%0A    %7D%0A%7D%0A%0Aclass ListNode %7B%0A    int val;%0A    ListNode next;%0A    ListNode(int x) %7B val = x; %7D%0A%7D%0A

solve #237