【leetcode】019.删除链表的倒数第n个结点

题目

【leetcode】019.删除链表的倒数第n个结点

解法

快慢指针

链表类题目的一个小tips是新建一个dummy节点

# 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: ListNode, n: int) -> ListNode:
        dummy = ListNode()
        dummy.next = head
        pre = dummy
        cur = dummy
        while n>0:
            cur = cur.next
            n = n-1
        while cur.next:
            cur = cur.next
            pre = pre.next
        pre.next = pre.next.next
        return dummy.next