题目:给你一个链表,删除链表的倒数第 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 node = new ListNode(-1);
node.next = head;
head = node;
while(node != null) {
ListNode curNode = node;
if(func(curNode, n) == null) {
node.next = node.next.next;
break;
}
node = node.next;
}
return head.next;
}
public ListNode func(ListNode node, int n) {
int i = 0;
while(i < n + 1) {
node = node.next;
i++;
}
return node;
}
}