203. Remove Linked List Elements

/**
* Definition for singly-linked list.
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
while(head&&head->val==val)
{
ListNode* temp=head;
head=head->next;
delete temp;
}
if(!head) return NULL;
ListNode* head0=head;
while(head0->next)
{
if(head0->next->val==val)
{
ListNode* temp=head0->next;
head0->next=head0->next->next;
delete temp;
}
else
head0=head0->next;
}
return head;
}
};