标签：self return removing ret code range 链表 for pytho
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.
经典链表问题
Python实现
# 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): res=ListNode(0) res.next=head tmp=res for i in range(0,n): head=head.next while head!=None: head=head.next tmp=tmp.next tmp.next=tmp.next.next return res.next
leetcode_019 Remove Nth Node From End of List
标签：self return removing ret code range 链表 for pytho
原文地址：http://www.cnblogs.com/ytq1016/p/6864166.html
