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后节点的值赋值给当前节点,再把这个节点删除。注意删除temp后要置NULL,不能有野指针
/**
* 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) {}
else{
ListNode *temp = node->next;
node->val = temp->val;
node->next = temp->next;
delete temp;
temp = NULL;
}
}
};