题目描述
给你一个链表,删除链表的倒数第 n
个结点,并且返回链表的头结点。
示例 1:
输入:head = [1,2,3,4,5], n = 2 输出:[1,2,3,5]
示例 2:
输入:head = [1], n = 1 输出:[]
示例 3:
输入:head = [1,2], n = 1 输出:[1]
思路
快慢指针
1)快的指针先走n步
2)之后快慢指针一起走,当快的指针走到尾部,慢指针所指的下一个则是要删除的节点
3)慢指针的next指向next.next,从而删除节点
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution(object):
def removeNthFromEnd(self, head, n):
"""
:type head: ListNode
:type n: int
:rtype: ListNode
"""
prehead = ListNode(-1)
prehead.next = head
slow = fast = prehead # 等于prehead,不是head
while n!=0:
fast = fast.next
n-=1
while fast.next:
fast = fast.next
slow = slow.next
slow.next = slow.next.next
return prehead.next