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 -> 4after 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) {        *node=*(node->next);    }};

 

leetcode 237. Delete Node in a Linked List