给定一个链表,删除链表的倒数第 n 个节点,并且返回链表的头结点。
示例:
给定一个链表: 1->2->3->4->5, 和 n = 2. 当删除了倒数第二个节点后,链表变为 1->2->3->5.
说明:
给定的 n 保证是有效的。
进阶:
你能尝试使用一趟扫描实现吗?
解答一:两遍扫描
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def removeNthFromEnd(self, head, n):
"""
:type head: ListNode
:type n: int
:rtype: ListNode
"""
if head.next==None:
head=None
return head
i=0
head1=head
while head1.next!=None:
head1=head1.next
i+=1
i=i-n
if i==-1:
head=head.next
return head
head2=head
while i>0:
head2=head2.next
i-=1
head2.next=head2.next.next
return head
解答二:一遍扫描
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def removeNthFromEnd(self, head, n):
"""
:type head: ListNode
:type n: int
:rtype: ListNode
"""
# first 先走n步,之后first和second一起向前,
# 直到first到达最后一个,测试second所在位置即为倒数第n个,也就是要删除的位置
first=head
second=head
for _ in range(n):
first=first.next
if not first:
return head.next
while first.next:
first=first.next
second=second.next
second.next=second.next.next
return head