LeetCode(237): Delete Node in a Linked List

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 void deleteNode(ListNode node) {
        node.val = node.next.val;
        node.next = node.next.next;
    }

LeetCode(237): Delete Node in a Linked List

原文：http://www.cnblogs.com/Lewisr/p/5128204.html