"Leetcode" Remove Linked List Elements (Easy)

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

Example
Given: 1---2--and 6---3---4---5, val = 6
Return: 1--2--and 3--4--5

Idea: Simple question.

//Definition for singly-linked list. structListNode {intVal; ListNode*Next; ListNode (intx): Val (x), Next (NULL) {}};classSolution { Public: ListNode* Removeelements (listnode* head,intval) {ListNode Fakehead= ListNode (0); Pseudo-head, simplified code fakehead.next=Head; ListNode*p = &Fakehead;  while(NULL! = p->next) {            if(P->next->val = = val)//the next number of the current number needs to be deleted and then re-judged the next digit of the current position.P->next = p->next->Next; Else                    //the next point in the current position does not need to be deleted, move the current position backp = p->Next; }        returnFakehead.next; }};

"Leetcode" Remove Linked List Elements (Easy)