leetcode 19 删除链表的倒数第N个结点

给你一个链表，删除链表的倒数第 n 个结点，并且返回链表的头结点。

进阶：你能尝试使用一趟扫描实现吗？

示例1

输入：head = [1,2,3,4,5], n = 2
输出：[1,2,3,5]

示例 2：

  输入：head = [1], n = 1

输出：[]

示例 3：

输入：head = [1,2], n = 1
输出：[1]

解题思路：使用快慢指针，快指针移动之后与慢指针的间隔指针个数为n个，然后快慢指针再同时走，当快指针走到末尾时，慢指针处于倒数第n+1个结点位置，让慢指针跳过倒数第n个结点即 slow.next = slow.next.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: ListNode, n: int) -> ListNode:
        dummy = ListNode(None)
        slow = dummy
        fast = dummy
        slow.next = head
        fast.next = head
        count = 0
        while count <= n :
            fast = fast.next
            count += 1
            
        while fast:
            slow = slow.next
            fast = fast.next
        slow.next = slow.next.next
        return dummy.next