题目链接🔗:删除链表倒数第N个节点
给你一个链表,删除链表的倒数第 n 个结点,并且返回链表的头结点。
输入:head = [1,2,3,4,5], n = 2 输出:[1,2,3,5] 示例 2:
输入:head = [1], n = 1 输出:[] 示例 3:
输入:head = [1,2], n = 1 输出:[1]
思路:双指针法,定义快慢指针指向头结点,要删除倒数第n个节点,想让fast向前移动n步,然后快慢指针同时移动,这样当fast为null时,slow指向的节点就是要删除的节点,这样只要让slow指向下个节点时,这样就删除倒数第n个节点。
这里要注意!!为了避免单独分析单个节点的情况,所以最好先定义一个虚拟头结点指向头结点,这样就避免单独分析情况
正确代码✅:
# 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
"""
dummy_head = ListNode()
dummy_head.next = head
fast,slow = dummy_head,dummy_head
for i in range(n+1):
fast = fast.next
while fast:
fast = fast.next
slow = slow.next
slow.next = slow.next.next
return dummy_head.next