class ClearValue {
public:
ListNode* clear(ListNode* head, int val) {
ListNode * p=head,*previous = NULL,*nxt=NULL;
while (head->val==val) {
nxt = head->next;
delete head;
head = nxt;
}
p = head->next;
previous = head;
while (p) {
nxt = p->next;
if(p->val ==val){
previous->next = nxt;
delete p;
}else
previous = p;
p = nxt;
}
return head;
}
};
链表所有为key的节点全部删除
最新推荐文章于 2023-01-07 20:35:30 发布