给你一个链表,删除链表的倒数第 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 dummyHead = new ListNode();
dummyHead.next = head;//dummyHead.next指向头节点
ListNode fast = dummyHead;//快指针
ListNode slow = dummyHead;//慢指针
n=n+1;
while(n!=0&&fast!=null){
n--;
fast = fast.next;//让快指针先走n+1步;
}
while(fast!=null){
fast= fast.next;
slow = slow.next;//快慢指针同时移动
}
slow.next = slow.next.next;
return dummyHead.next;
}
}