链接:https://leetcode-cn.com/problems/remove-linked-list-elements/submissions/
//1.先后指针法(选择性删除)
struct ListNode* removeElements(struct ListNode* head, int val)
{
struct ListNode* pre=NULL;
struct ListNode* cur=head;
while(cur)
{
if(cur->val==val)
{
if(pre==NULL)//单个节点的时候--头删
{
head= cur->next;
free(cur);
cur=head;
}
else//多个节点的时候
{
struct ListNode* next=cur->next;
pre->next=cur->next;
free(cur);
cur=next;
}
}
else
{
pre=cur;
cur=cur->next;
}
}
return head;
}
//2.尾插法(选择性插入法)
//3.哨兵位法