64、【链表】leetcode——203. 移除链表元素（C++版本）

辰阳星宇

已于 2022-12-30 20:21:17 修改

阅读量89

点赞数

分类专栏：数据结构与算法刷题 # 链表文章标签： leetcode 链表 c++

于 2022-12-30 10:53:51 首次发布

本文链接：https://blog.csdn.net/qq_41094332/article/details/128492400

版权

数据结构与算法刷题同时被 2 个专栏收录

214 篇文章 16 订阅

订阅专栏

链表

14 篇文章 1 订阅

订阅专栏

题目描述

在这里插入图片描述

增设虚拟头节点

仅用pre遍历

/**
 * 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) {
        if(head == nullptr)    return nullptr;

        ListNode* dummyNode = new ListNode(0);
        dummyNode->next = head;
        ListNode* pre = dummyNode, *temp = nullptr;
        while(pre->next != nullptr) {
            if(pre->next->val == val) {
                temp = pre->next;
                pre->next = temp->next;
                delete temp;
            }else{
                pre = pre->next;
            }
        }
        head = dummyNode->next;
        delete dummyNode;

        return head;
    }
};

用pre和cur遍历

/**
 * 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) {
        if(head == nullptr)    return nullptr;

        ListNode* dummyNode = new ListNode(0);
        dummyNode->next = head;
        ListNode* pre = dummyNode, *cur = dummyNode->next, *temp = nullptr;
        while(cur != nullptr) {
            if(cur->val == val) {
                temp = cur;
                pre->next = temp->next;
                cur = temp->next;
                delete temp;
            }else{
                pre = pre->next;
                cur = cur->next;
            }
        }

        head = dummyNode->next;
        delete dummyNode;

        return head;
    }
};