删除链表的倒数第 N 个结点
给你一个链表,删除链表的倒数第 n 个结点,并且返回链表的头结点。
快慢指针:
/**
* 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 dummyhead = new ListNode(0,head);
ListNode slow =dummyhead;
ListNode fast =dummyhead;
//快指针先向前移动n+1步
for(int i =0 ; i<=n;i++){
fast=fast.next;
}
//然后快慢指针同时向前移动,直到fast指向null
while(fast!=null){
slow=slow.next;
fast=fast.next;
}
//慢指针的下一个节点指向待删除节点
ListNode delete =slow.next;
//把待删除节点的左右链接都弄没
slow.next=delete.next;
delete.next =null;
//最后不直接返回头节点,因为可能头节点是待删除节点
return dummyhead.next;
}
}