题目描述
给你一个链表,删除链表的倒数第 n 个结点,并且返回链表的头结点。
输入:head = [1,2,3,4,5], n = 2
输出:[1,2,3,5]
实现
快慢指针,快指针先走n步,两指针再同时走,快指针指向NULL时慢指针就指向要删除的节点,此时只要删除该节点。
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
# 双指针
def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:
dummy = ListNode(0, head)
# pre 将会指向要删除的前一个节点
pre, fast = dummy, head
for _ in range(n):
fast = fast.next
while fast:
pre = pre.next
fast = fast.next
pre.next = pre.next.next
return dummy.next
链接:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/