给你一个链表的头节点 head
和一个整数 val
,请你删除链表中所有满足 Node.val == val
的节点,并返回 新的头节点 。
示例 1:
输入:head = [1,2,6,3,4,5,6], val = 6 输出:[1,2,3,4,5]
示例 2:
输入:head = [], val = 1 输出:[]
示例 3:
输入:head = [7,7,7,7], val = 7 输出:[]
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
//先判断头节点
while(head != NULL&&head->val==val){
ListNode* tem =head;
head= head->next;
delete tem; //释放
}
//删除非头节点
ListNode* cur =head;
while(cur!=NULL&&cur->next!=NULL){
if(cur->next->val==val){
ListNode* tem =cur->next;
cur->next=cur->next->next; //下一个进行覆盖
delete tem; //释放
}
else{
cur = cur->next;
}
}
return head;
}
};