leetcode-203

class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        ListNode* dummyHead = new ListNode(0); //设置一个初始头结点
        dummyHead->next = head;
        ListNode* cur = dummyHead;
        while(cur->next!=nullptr){
            if(cur->next->val==val){
                ListNode* deletePoint;
                deletePoint = cur->next;
                cur->next = cur->next->next;
                delete(deletePoint);
            }
            else{
                cur = cur->next;
            }
    }
    head = dummyHead->next;
    delete dummyHead;
    return head;
    }
};