005.使用虚拟头节点解决链表问题:LeetCode 203. 移除链表元素

/**
 * 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) {
        ListNode* dummyHead=new ListNode(0);
        dummyHead->next=head;

        ListNode *cur=dummyHead;
        while(cur->next!=NULL)
        {
            if(cur->next->val==val)
            {
                //删除cur->next
                ListNode* delNode=cur->next;
                cur->next=delNode->next;
                delete delNode;
            }
            else
            {
                cur=cur->next;
            }
        }
        ListNode* retNode=dummyHead->next;
        delete dummyHead;

        return retNode;
    }   
};