/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val)
{
//删除头节点
while (head!=NULL&&head->val==val)
{
ListNode*temp=head;
head=head->next;
delete temp;
}
ListNode* p=head;
//删除非头结点
while(p!=NULL&&p->next!=NULL)
{
if(p->next->val==val)
{
ListNode* temp=p->next;
p->next=p->next->next;
delete temp;
}
else
{
p=p->next;
}
}
return head;
}
};
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
ListNode* newhead=new ListNode();//建立一个新头节点
newhead->next = head;
ListNode *p = newhead;
while (p->next != NULL) {
if (p->next->val == val) {
ListNode* temp=p->next;
p->next=p->next->next;
// delete temp;
} else {
p = p->next;
}
}
head = newhead->next;
delete newhead;
return head;
}
};