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.

本题目意思为：仅仅给出一个链表节点，删除这个节点

直接让这个节点等于这个节点的下一个节点即可。

C语言代码如下：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
void deleteNode(struct ListNode* node) {
    if(node != NULL)
    {
        node->val = node->next->val;
        node->next = node->next->next;
    }
}

237_Delete Node in a Linked List

原文：http://www.cnblogs.com/Anthony-Wang/p/5001348.html