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.
奇妙的思维转换,刚开始没有想出来解法,惭愧。
class Solution {
public:
void deleteNode(ListNode* node) {
ListNode* prenode;
while(node->next){
node->val = node->next->val;
prenode = node;
node = node->next;
}
prenode->next = NULL;
delete node;
}
};