链表基本操作-删除

链表基本操作-删除

题意:删除链表中等于给定值va的所有节点。
示例1
输入:head=[1,2,6,3,4,5,6],va|=6 输出:[1,2,3,4,5
例2
输入:head
va|=1
输
示例3
输入:head=[777,7],va=7 输出:[

分析：在需要删除的链表的头节点之前再加一个节点，统一删除方式

#include <vector>
#include <iostream>
using namespace std;

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){
            if (cur -> next -> val == val){
                ListNode* tmp = cur -> next;
                cur -> next  = cur -> next -> next;
                delete tmp;
            }else{
                cur = cur -> next;
            }
        }
        head = dummyhead -> next;
        delete dummyhead;
        return head;
    }

};

int main(){
    Solution s;
    ListNode* head = new ListNode(5);
    ListNode* cur = head;
    for(int i = 0; i < 6; i++){
        ListNode* tmp = new ListNode(i);
        cur -> next = tmp;
        cur = cur -> next;
    }
    ListNode* res = s.removeElements(head, 2);
    while (res){
        cout << res -> val << endl;
        res = res -> next;
    }
}