python leetcode 19. Remove Nth Node From End of List

利用快慢指针求出总长度，再看n位于前半段还是后半段

class Solution(object):
    def removeNthFromEnd(self, head, n):
        """
        :type head: ListNode
        :type n: int
        :rtype: ListNode
        """
        count=0 
        slow = head 
        fast = head 
        while fast and fast.next:
            slow = slow.next 
            fast = fast.next.next 
            count+=1
        if n < count:
            if fast==None:
                count -=1 
            while count > n:
                slow=slow.next 
                count-=1
            slow.next=slow.next.next
        else:
            if fast == None:
                k = 2*count - n 
            else:
                k = 2*count +1 -n 
            if k==0:
                return head.next 
            else:
                p=head
                while k>1:
                    p = p.next 
                    k-=1 
                p.next = p.next.next
        return head