leetcode 刷题记录 203移除链表元素

IC菜鸡

已于 2022-09-05 23:01:44 修改

阅读量79

点赞数

文章标签：链表 leetcode 数据结构 c++

于 2022-09-05 23:01:36 首次发布

本文链接：https://blog.csdn.net/weixin_60948473/article/details/126714563

版权

/**
 * 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) {
        ListNode *p, *t; 
        while(head && head->val == val){ //单独处理头节点
            t = head;
            head = head->next;
            delete t;
        }
        p = head;
        while(head && head->next){
            if(head->next->val == val){
                t = head->next;
                head->next = head->next->next;
                delete t;
            }else head = head->next;
        }
        head = p;
        return head;
    }
};

/**
 * 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) {
        ListNode *p = new ListNode(), *t; //使用辅助头节点
        p->next = head;
        head = p;
        while(head->next){
            if(head->next->val == val){
                t = head->next;
                head->next = head->next->next;
                delete t;
            }else head = head->next;
        }
        head = p->next;
        delete p;
        return head;
    }
};