- 删除链表的倒数第 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
代码:
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
//初始化前置节点,目标节点,后置节点
ListNode preNode = head;
ListNode target = head;
ListNode sufNode = head.next;
//当前节点引用,当前节点在链表中的位置
ListNode currentNode = head;
int currentCount = 1;
while (currentNode != null) {
//确定要删除的节点
if (currentCount > n){
preNode = target;
target = sufNode;
sufNode = sufNode.next;
}
currentNode = currentNode.next;
currentCount += 1;
}
//删除目标节点
preNode.next = sufNode;
//删除的是头结点时,头结点引用往后移
if (target == head){
head = head.next;
}
return head;
}
}