题目:
给定一个链表,删除链表的倒数第 n 个节点,并且返回链表的头结点。
示例:
给定一个链表: 1->2->3->4->5, 和 n = 2.
当删除了倒数第二个节点后,链表变为 1->2->3->5.
代码(快慢双指针)
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def removeNthFromEnd(self, head: ListNode, n: int) -> ListNode:
if n == 0: # 若 n 等于0, 直接返回原链表
return head
dummy = ListNode(None) # 建立虚拟头结点
dummy.next = head
slow = fast = dummy # 快慢双指针
for _ in range(n): # 循环,让快指针先走 n 步
fast = fast.next
while fast and fast.next: # 快慢指针一起走
slow = slow.next
fast = fast.next
slow.next = slow.next.next # 跳过倒数第n个节点
return dummy.next