leetcode.203\707—虚拟头结点-CSDN博客

本文链接：https://blog.csdn.net/Ymmmm__/article/details/147579818

lc203.移除链表元素

由于头结点和其他节点删除方式不同，我们引入虚拟头节点来统一删除方式

class Solution:
    def removeElements(self, head: Optional[ListNode], val: int) -> Optional[ListNode]:
        if not head:
            return None
        dummy_head = ListNode()
        dummy_head.next = head
        cur = dummy_head
        while cur and cur.next:
            if cur.next.val == val:
                cur.next = cur.next.next
            else:
                cur = cur.next
        return dummy_head.next

lc707.设计链表

利用size和虚拟头节点简化代码逻辑，避免“求链表长度”遍历的时间成本

class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

class MyLinkedList:

    def __init__(self):
        self.dummy_head = ListNode()
        self.size = 0

    def get(self, index: int) -> int:
        if index >= self.size:
            return -1
        cur = self.dummy_head
        for _ in range(index + 1):
            cur = cur.next
        return cur.val

    def addAtHead(self, val: int) -> None:
        head = ListNode(val)
        head.next = self.dummy_head.next
        self.dummy_head.next = head
        self.size += 1

    def addAtTail(self, val: int) -> None:
        tail = ListNode(val)
        cur = self.dummy_head
        while cur.next:
            cur = cur.next
        cur.next = tail
        self.size += 1

    def addAtIndex(self, index: int, val: int) -> None:
        if index > self.size:
            return
        new_node = ListNode(val)
        cur = self.dummy_head
        for _ in range(index):
            cur = cur.next
        new_node.next = cur.next
        cur.next = new_node
        self.size += 1
        

    def deleteAtIndex(self, index: int) -> None:
        if index >= self.size:
            return
        cur = self.dummy_head
        for _ in range(index):
            cur = cur.next
        cur.next = cur.next.next
        self.size -= 1