/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    /**
     * @param head a ListNode
     * @param val an integer
     * @return a ListNode
     */
    ListNode *removeElements(ListNode *head, int val) {
        // Write your code here
        if(head == NULL )return NULL;
        while(head != NULL && head->val == val)
        {
            head = head->next;
        }
        if(head == NULL )return NULL;
        ListNode *p = head;
        while(p->next != NULL)
        {
            if(p->next->val != val)
            p = p->next;
            else
            {
                ListNode *tmp = p->next;
                while(tmp != NULL && tmp->val == val)
                {
                    tmp = tmp->next;
                }
                p->next = tmp;
                p = p->next;
            }
            if(p == NULL)break;
        }
        return head;
        
    }
};