19. 删除链表的倒数第 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
/**
* 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) {
ListNode fast = head,slow = head;
int i = 1;
if(fast == null) return null;
//考虑结点在两个以上的情形
while(fast.next != null){
if(i<=n) {
fast = fast.next;
i++;
}else{
fast = fast.next;
slow = slow.next;
}
}
//考虑只有两个结点却要求删除倒数第二个结点
if(i!=n+1) head = head.next;
//考虑只有一个结点
if(slow.next==null) return null;
slow.next = slow.next.next;
return head;
}
}