Leetcode 203. 移除链表元素

最新推荐文章于 2024-10-12 23:06:01 发布

Shoko0116

最新推荐文章于 2024-10-12 23:06:01 发布

阅读量299

点赞数

分类专栏：力扣文章标签：链表 leetcode 数据结构

本文链接：https://blog.csdn.net/qq_24997277/article/details/121853888

版权

力扣专栏收录该内容

42 篇文章 1 订阅

订阅专栏

203. 移除链表元素

Ideas

数据结构：链表

Code

时间复杂度：O(N)，N为链表长度
空间复杂度：O(1)

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def removeElements(self, head: ListNode, val: int) -> ListNode:
        if not head:
            return None
        
        # 因为头节点可能被删除，所以创建哑结点
        dummy = ListNode(0, head)
        cur = dummy

        while(cur.next):
            if (cur.next.val == val):
                cur.next = cur.next.next
            else:
                cur = cur.next
        return dummy.next

C++

/**
 * 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* dummy = new ListNode(0, head);
        ListNode* cur = dummy;
        if(head == nullptr) {
            return head;
        }
        while(cur->next) {
            if(cur->next->val == val) {
                cur->next = cur->next->next;
            } else {
                cur = cur->next;
            }
        }
        ListNode* ans = dummy->next;
        delete dummy;
        return ans;
    }
};