链表（leetcode）2021-9-6

最新推荐文章于 2024-10-08 10:36:00 发布

浓浓-轻寒

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量61

点赞数

分类专栏： python题

本文链接：https://blog.csdn.net/qq_44827840/article/details/120129729

版权

链表 leetcode

python题专栏收录该内容

6 篇文章 0 订阅

订阅专栏

2021.9.6

19、删除链表倒数第n个节点（中等）

解法一：获得链表长度

class Solution:
    def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:
        def getLength(head):
            length = 0
            while head:
                length += 1
                head = head.next
            return length

        dummy = ListNode(0,head)
        cur = dummy
        L = getLength(head)
        for i in range(1,L-n+1):
            cur = cur.next

        cur.next = cur.next.next
        return dummy.next

解法二：双指针

class Solution:
    def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:
        dummy = ListNode(0,head)
        n1 = dummy
        n2 = dummy
        for i in range(n+1):
            n2 = n2.next
        
        while n2:
            n1 = n1.next
            n2 = n2.next
        
        n1.next = n1.next.next
        return dummy.next

26、删除排序链表中的重复元素

1、遍历

class Solution:
    def deleteDuplicates(self, head: ListNode) -> ListNode:
        curr = head
        while curr.next != None:
            if curr.val == curr.next.val:
                curr.next = curr.next.next
            else:
                curr = curr.next

        return head

206 、反转链表

1.1 反转指针

class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        prev = None
        curr = head
        next = head
        while curr != None:
            next = curr.next
            curr.next = prev
            prev = curr
            curr = next 

        return prev

1.2

class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        prev = None
        curr = head
        next = head
        while curr != None:
          curr.next,prev,curr = prev,curr,curr.next
        return prev

2.迭代法

class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        dummy = ListNode()
        dummy.next = head
        while (head != None and head.next != None):
            curr = head.next
            temp = dummy.next   
            dummy.next,head.next,curr.next = curr,curr.next,temp
        return dummy.next