Given a linked list, remove the n-th node from the end of list and return its head.
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.
剑指offer上有一道和这个类似的题,那道题是找链表中倒数第n个元素。找倒数第n个元素的方法就是用快慢两个指针f和s,开始先让f走,每走一步n-1,当n走到0的时候s开始走。注意while循环里的判断顺序,跳出是f==None。循环里,首先f往下走一步,然后判断n<1,即n等于0时,这时先把s赋值给pre,再让s走一步。最后循环跳出时要判断一下,因为删除的操作是让pre的next接到s的下一个,所以pre不能是None。如果n就是链表长度,倒数第n个是head,那么就直接删除head。如果不是,再操作pre。
# 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
"""
if head==None:
return None
f=head
s=head
pre=None
while f!=None:
f=f.next
if n<1:
pre=s
s=s.next
n=n-1
if s==head:
return s.next
else:
pre.next=s.next
s.next=None
return head