leetcode19. Remove Nth Node From End of List

Given a linked list, remove the nth node from the end of list and return its head.

For example,

Given linked list: 1->2->3->4->5, and n = 2.

After removing the second node from the end, the linked list becomes 1->2->3->5.
Note:
Given n will always be valid.
Try to do this in one pass.
思路：设置两个指针，相差n，当一个指针遍历到链表结尾时候，另一个指针的位置为要删除结点的前一个位置。

# 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):
        ans = ListNode(0)
        ans.next = head
        p=ans
        q=ans

        for i in range(n):
            q=q.next

        while q.next:
            p=p.next
            q=q.next

        dele=p.next
        p.next=dele.next
        del dele
        return ans.next