203. 移除链表元素

题目描述

点这里

思路分析

链表模拟题

代码实现

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
 //重开链表
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        auto dummy=new ListNode(-1);
        auto p=dummy;
        for(auto q=head;q;q=q->next){
            if(q->val==val)continue;
            else{
                p=p->next=q;
            }
        }
        p->next=NULL;
        return dummy->next;
    }
};
//原地修改
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        auto dummy = new ListNode(-1);
        dummy->next = head;
        for (auto p = dummy; p; p = p->next) {
            auto q = p->next;
            while (q && q->val == val) q = q->next;
            p->next = q;
        }
        return dummy->next;
    }
};