[LeetCode] 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.

这题很有意思，给一个单链表的某个节点，然后删除它。一开始还以为是传统的单链表操作题，仔细看了题目才发现不能用传统的链表操作，因为没给链表头，只给了要删除的那个节点。这时候就要用奇技淫巧了，就是通过把前一个Node 的val 向前复制来达到“删除” 的效果。。。。

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

[LeetCode] Delete Node in a Linked List

原文：http://www.cnblogs.com/agentgamer/p/4899644.html