代码随想录打卡d3:反转链表、设计链表、移除链表元素

反转链表

刷题日期:2024-04-19
[[206.反转链表]]

思路

双指针法, 快指针指向原链表头节点, 慢指针指向反转后链表头节点

算法思路

定义一个慢指针指向空节点作为反转后链表头节点, 快指针指向原链表头节点. 反转时先保存快指针的next节点, 然后再断开, 将next指向慢指针, 慢指针快指针向后移动

算法细节

1.

Code

class Solution:
    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        cur = head
        pre = None

        while cur:
            temp = cur.next
            cur.next = pre
            pre = cur
            cur = temp
        return pre

设计链表

刷题日期:2024-04-19
[[707.设计链表]]

思路

虚拟头节点

算法思路

算法细节

1.

Code

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

class MyLinkedList:

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

    def get(self, index: int) -> int:
        if index < 0 or index >= self.length:
            return -1
        cur = self.dummyHead.next
        for i in range(index):
            cur = cur.next
        return cur.val

    def addAtHead(self, val: int) -> None:
        cur = self.dummyHead.next
        self.length += 1
        self.dummyHead.next = ListNode(val, cur)

    def addAtTail(self, val: int) -> None:
        cur = self.dummyHead
        for i in range(self.length):
            cur = cur.next
        cur.next = ListNode(val)
        self.length += 1

    def addAtIndex(self, index: int, val: int) -> None:
        if index > self.length:
            return     
        else:
            cur = self.dummyHead
            for i in range(index):
                cur = cur.next
            temp = cur.next
            cur.next = ListNode(val, temp)
            self.length += 1

    def deleteAtIndex(self, index: int) -> None:
        if index >= self.length:
            return
        else:
            cur = self.dummyHead
            for i in range(index):
                cur = cur.next
            cur.next = cur.next.next
            self.length -= 1

移除链表元素

刷题日期:2024-04-19
[[203.移除链表元素]]

思路

虚拟节点法

算法思路

定义虚拟节点, next指向原链表头节点; 遍历整个链表, 满足条件便移除

算法细节

1.

Code

class Solution:
    def removeElements(self, head: Optional[ListNode], val: int) -> Optional[ListNode]:
        dummy = ListNode(-1, head)
        cur = dummy

        while cur.next:
            if cur.next.val == val:
                cur.next = cur.next.next
            else:
                cur = cur.next

        return dummy.next