[Leetcode] Remove Linked List Elements

Remove all elements from a linked list of integers, that has value Val.

Example
given:1–> 2–> 6–> 3–> 4–> 5–> 6, val = 6
Return:1–> 2–> 3–> 4–> 5

This is a simple question that requires deleting a node in a single linked list that is equal to the specified value. On the basis of traversing a single linked list, the comparison is completed, and a head node is added to facilitate operation.

 listnode* Removeelements (listnode* head, int  val) {Li stnode* h = new ListNode (0 ); H->next  = head; listnode* p = h; while  (P->next ) {if  (P->next ->val = = val) { listnode* temp = P->next ; P->next  = Temp->next ; delete  temp; } else  {p = p->next ; }} return  h->next ; }

[leetcode]remove Linked List Elements