给你一个链表,删除链表的倒数第 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]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
//base case
if(head == null){
return null;
}
//设置快慢节点
ListNode low = head;
ListNode fast = head;
//快结点比慢节点多n个数字
for(int i = 0;i < n;i++){
fast = fast.next;
}
//如果说fast为空,说明需要删除首节点,所以返回low.next
if(fast == null){
return low.next;
}
while(fast.next!=null){
fast = fast.next;
low = low.next;
}
low.next = low.next.next;
return head;
}
}