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

解题思路：

这道题的意思是，给定链表中的一个节点，删除它。题目并没有给定链表头。大体思路是，将后面的节点一个一个往前移即可。最后一个节点需要特殊处理一下。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    void deleteNode(ListNode* node) {
        ListNode* pre=node;
        //题目说了不可能是末尾的节点
        while(node->next!=NULL){
            node->val = node->next->val;
            pre=node;
            node=node->next;
        }
        delete(node);
        pre->next=NULL;
    }
};

[LeetCode] Delete Node in a Linked List

原文：http://blog.csdn.net/kangrydotnet/article/details/47040381