删除链表的倒数第 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]

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list

My_CODE：

# 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:
        re = head
        len= 0
        pre = None
        while re:
            len += 1
            re = re.next
        re = head
        index = len - n
        for _ in range(index):
            pre = re
            re = re.next
        if not pre:
            head = re.next
        else:
            pre.next = re.next
        return head

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

Other：

    a = head
    b = head

    for i in range(n):
        if a.next:
            a = a.next
        else:
            return head.next

    while a.next:
        a = a.next
        b = b.next
    b.next = b.next.next
    return head