【代码随想录训练营】【Day 3】【链表】| Leetcode 203, 707, 206

最新推荐文章于 2024-07-09 23:43:07 发布

花花啊啦啦啦

最新推荐文章于 2024-07-09 23:43:07 发布

阅读量245

点赞数 6

文章标签：链表 leetcode python

本文链接：https://blog.csdn.net/qq_44574200/article/details/138013593

版权

【代码随想录训练营】【Day 3】【链表】| Leetcode 203, 707, 206

题目

[203. 移除链表元素](https://leetcode.cn/problems/remove-linked-list-elements/description/

使用虚拟节点
注意ListNode定义

# 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]:
        dummy_head = ListNode(next=head)
        cur = dummy_head

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

707. 设计链表

注意self.size的使用，以及是否超出self.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:
        i = -1
        cur = self.dummy_head
        if index >= self.size:
            return -1
        while i < index:
            cur = cur.next
            i += 1
        return cur.val


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

    def addAtTail(self, val: int) -> None:
        i = 0
        cur = self.dummy_head
        # while cur.next:
        #     cur = cur.next
        while i < self.size:
            cur = cur.next
            i += 1
        cur.next = ListNode(val = val, next=None)
        self.size += 1
        return

    def addAtIndex(self, index: int, val: int) -> None:
        if index > self.size:
            return 
        if index == self.size:
            self.addAtTail(val)
            return 
        i = -1
        cur = self.dummy_head
        while i < index - 1:
            cur = cur.next
            i += 1
        cur.next = ListNode(val=val, next=cur.next)
        self.size += 1
        return 

    def deleteAtIndex(self, index: int) -> None:
        if index >= self.size:
            return 
        i = -1
        cur = self.dummy_head
        while i < index-1:
            cur = cur.next
            i += 1
        cur.next = cur.next.next
        self.size -= 1
        return 



# 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. 反转链表

先写核心句，cur.next = pre，然后完善其他部分
注意head节点也要反转，pre初始值应为None

# 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]:
        if head == None:
            return head
        pre, cur = None, head

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