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) {
if(node==NULL||node->next==NULL)
return ;
else
{
ListNode *temp=node->next;
node->val=temp->val;
node->next=temp->next;
delete temp;
temp=NULL;
}
}
};
其他Leetcode题目AC代码:https://github.com/PoughER/leetcode