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

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

示例：

给定一个链表: 1->2->3->4->5, 和 n = 2.

当删除了倒数第二个节点后，链表变为 1->2->3->5.

说明：

给定的 n 保证是有效的。

# Definition for singly-linked list.
class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None

class Solution:
    def removeNthFromEnd(self, head, n):
        """
        :type head: ListNode
        :type n: int
        :rtype: ListNode
        """
        tmp = head
        
        cnt = 0
        while tmp:
            cnt+=1
            tmp = tmp.next
        # print(cnt)

        ans = ListNode(-1)
        tmp = ans

        for _ in range(cnt-n):
            tmp.next = ListNode(head.val)
            tmp = tmp.next
            head = head.next

        head = head.next
        while head:
            tmp.next = ListNode(head.val)
            tmp = tmp.next
            head = head.next

        return ans.next