小黑迷茫抑郁中的leetcode之旅:19. 删除链表的倒数第 N 个结点

小黑代码

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:
        arr = []
        node = head
        while node:
            arr.append(node)
            node = node.next
        
        l = len(arr)
        if n > l:
            return head
        elif n == l:
            return head.next
        else:
            arr[0-n-1].next = arr[0-n].next
            return head

链表长度法

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:
        def get_length(link):
            length = 0
            while link:
                length += 1
                link = link.next
            return length
        # 获取长度
        link = head
        length = get_length(link)
        # 增加辅助结点
        add_node = ListNode(next=head)
        link = add_node
        # 寻找其前驱结点
        for i in range(length-n):
            link = link.next
        # 删除操作
        link.next = link.next.next
        return add_node.next

栈法

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:
        add_node = ListNode(next = head)
        link = add_node
        # 结点压入栈中
        q = []
        while link:
            q.append(link)
            link = link.next
        # pop出n个结点
        for i in range(n):
            q.pop()
        prev = q.pop()
        prev.next = prev.next.next
        return add_node.next

双指针法

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:
        # 快慢结点差n+1,慢结点代表该结点前驱
        add_node = ListNode(next = head)
        fast = add_node
        slow = add_node
        for i in range(n+1):
            fast = fast.next
        while fast:
            fast = fast.next
            slow = slow.next
        slow.next = slow.next.next
        return add_node.next