剑指 Offer II 021. 删除链表的倒数第 n 个结点

题目链接

力扣

题目描述

给定一个链表，删除链表的倒数第 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]
 

提示：

链表中结点的数目为 sz
1 <= sz <= 30
0 <= Node.val <= 100
1 <= n <= sz
 

进阶：能尝试使用一趟扫描实现吗？

解题思路

设置前后两个指针，前指针比后指针快n步，当前指针的next为空时，后指针的next正好指向需要删掉的结点

代码

Python

def removeNthFromEnd(head: ListNode, n: int) -> ListNode:
    front, back = head, head
    for i in range(n):
        front = front.next
    if front == None:
        return head.next
    while front.next != None:
        front = front.next
        back = back.next
    back.next = back.next.next
    return head

Go

func removeNthFromEnd(head *ListNode, n int) *ListNode {
	front, back := head, head
	for i := 0; i < n; i++ {
		front = front.Next
	}
	if front == nil {
		return head.Next
	}
	for {
		if front.Next == nil {
			break
		}
		front = front.Next
		back = back.Next
	}
	temp := back.Next
	back.Next = temp.Next
	return head
}