DAY9：leetcode #19 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.

Subscribe to see which companies asked this question

# 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
        """
        pointer = head
        buffer_list = [head]
        while pointer.next:
            pointer = pointer.next
            buffer_list.append(pointer)
        if len(buffer_list) < 1:
            return []
        elif n == len(buffer_list):
            head = head.next
            return head
        else:
            buffer_list[-(n+1)].next = buffer_list[-n].next
            return head