LeetCode: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.

解法：（参考博客：http://www.cnblogs.com/tjuloading/p/4648652.html）
将当前结点伪装成下一个结点，然后删除下一个结点即可。（真是太巧妙了，以前都没想到过这种删除方法）

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public void deleteNode(ListNode node) {
        node.val = node.next.val;
        node.next = node.next.next;
    }
}

转载于:https://www.cnblogs.com/wenbaoli/p/5655740.html