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) {
if(node == NULL)
return;
ListNode* tmp = node->next;
node->val = tmp->val;//直接使用内容替换的方式来删除,可以达到O(1)的算法时间复杂度。
node->next = tmp->next;
delete tmp;//记得释放
}
};