19. 删除链表的倒数第 N 个结点 - 力扣(LeetCode)
题目描述
解题思路
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
//删除倒数第N个节点,需要找到倒数N + 1个节点
//通过快慢指针找到倒数N + 1个节点
ListNode dummy = new ListNode(0);
dummy.next = head;
ListNode slow = dummy, fast = head;
for(int i = 0; i < n; i ++){
fast = fast.next;
}
while(fast != null){
fast = fast.next;
slow = slow.next;
}
slow.next = slow.next.next;
return dummy.next;
}
}