"Leetcode?python" 19. Remove Nth Node from End of List

Dual-pointer thought: Two pointers are n-1, each two pointers backwards, when a pointer is not followed, the successor of the previous pointer is the node to be deleted

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

Class solution (Object):
def removenthfromend (self, head, N):
"""
: Type Head:listnode
: Type N:int
: Rtype:listnode
"""
Dummy=listnode (0)
Dummy.next=head
P=dummy
Q=dummy
For I in range (n):
Q=q.next
While Q.next:
P=p.next
Q=q.next

Rec=p.next
P.next=rec.next
Del Rec
Return Dummy.next

"Leetcode?python" 19. Remove Nth Node from End of List