[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]

提示：

• 链表中结点的数目为 sz
• 1 <= sz <= 30
• 0 <= Node.val <= 100
• 1 <= n <= sz

思路：求出链表的长度，删除倒数第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: ListNode, n: int) -> ListNode:
#         dummy = ListNode(0, head)
#         first = head
#         second = dummy
#         for i in range(n):
#             first = first.next

#         while first:
#             first = first.next
#             second = second.next
        
#         second.next = second.next.next
#         return dummy.next


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