# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = NoneclassSolution:defremoveNthFromEnd(self, head: ListNode, n:int)-> ListNode:
a = head
b = head
for i inrange(n):if a:
a = a.nextelse:return head
ifnot a:
head = head.nextreturn head
while a.next:
a = a.next
b = b.next
b.next= b.next.nextreturn head
# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = NoneclassSolution:defremoveNthFromEnd(self, head: ListNode, n:int)-> ListNode:
p = ListNode(0)
p.next= head
a = b = p
while n:
b = b.next
n -=1while b.next:
a = a.next
b = b.next
a.next= a.next.nextreturn p.next