## leetcode–Remove Nth Node From End of List

1,713次阅读

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

For example,

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

After removing the second node from the end, the linked list becomes <b>1->2->3->5</b>.


Note: Given n will always be valid. Try to do this in one pass.

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

class Solution(object):
"""
:type n: int
:rtype: ListNode
"""
ncount=0
while ncount<n:
ncount+=1