LeetCode刷题（python3）|day03 第二章链表part01

最新推荐文章于 2024-11-11 20:59:17 发布

qq_41813878

最新推荐文章于 2024-11-11 20:59:17 发布

阅读量440

点赞数 8

文章标签： leetcode 链表 python

本文链接：https://blog.csdn.net/qq_41813878/article/details/135866989

版权

本文介绍了如何在Python中实现链表的操作，包括删除指定值的节点、设计链表类并处理边界条件，以及反转链表的方法。

摘要由CSDN通过智能技术生成

203.移除链表元素

# 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: Optional[ListNode], val: int) -> Optional[ListNode]:
        virtualHead = ListNode(-1, head)
        pre = virtualHead
        cur = virtualHead.next
        while cur != None:
            if cur.val == val:
                cur = cur.next
                pre.next = cur
            else:
                pre = cur
                cur = cur.next
        return virtualHead.next

707.设计链表
卡bug卡了很久，对于边界条件不够清晰

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

class MyLinkedList:

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

    def get(self, index: int) -> int:
        if index < 0 or index >= self.size:
            return -1
        cur = self.dummyHead.next
        n = index
        while n > 0:
            cur = cur.next
            n -= 1
        return cur.val


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

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

    def addAtIndex(self, index: int, val: int) -> None:
        if index < 0 or index > self.size:
            return
        newNode = ListNode(val, None)
        n = index
        pre = self.dummyHead
        while n > 0:
            pre = pre.next
            n -= 1
        newNode.next = pre.next
        pre.next = newNode
        self.size += 1
        
    def deleteAtIndex(self, index: int) -> None:
        if index < 0 or index >= self.size:
            return
        n = index
        pre = self.dummyHead
        while n > 0:
            pre = pre.next
            n -= 1
        if pre.next != None:
            pre.next = pre.next.next
            self.size -= 1




# Your MyLinkedList object will be instantiated and called as such:
# obj = MyLinkedList()
# param_1 = obj.get(index)
# obj.addAtHead(val)
# obj.addAtTail(val)
# obj.addAtIndex(index,val)
# obj.deleteAtIndex(index)

206.反转链表

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        vitualHead1 = ListNode(0, head)
        vitualHead2 = ListNode()

        first = True
        while vitualHead1.next != None:
            cur = vitualHead1.next
            vitualHead1.next = vitualHead1.next.next
            cur.next = vitualHead2.next
            vitualHead2.next = cur
        return vitualHead2.next