Leetcode Remove Linked list Elements Delete linked list elements

Test instructions: Removes all elements in the linked list that have an element value of Val.

Idea: The algorithm complexity is definitely O (n), then the pursuit of less code and less additional operations. I can't do it.

1 /**2 * Definition for singly-linked list.3 * struct ListNode {4 * int val;5 * ListNode *next;6 * ListNode (int x): Val (x), Next (NULL) {}7  * };8  */9 classSolution {Ten  Public: Onelistnode* removeelements (listnode* head,intval) { A          while(Head&&head->val==val) head=head->Next; -         if(!head)return 0; -ListNode *tmp=head; the          while(head&&head->next) -         { -             if(head->next->val==val) -Head->next=head->next->Next; +             Else -Head=head->Next; +         } A         returntmp; at     } -};

Remove Linked List Elements

Leetcode Remove Linked list Elements Delete linked list elements