/**
* 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 dummy = new ListNode(-1);
dummy.next = head;
ListNode slow = dummy; //需要删除的节点
ListNode fast = dummy;
while (n-- > 0) { //先让fast前移n个位置
fast = fast.next;
}
// 记住 待删除节点slow 的上一节点
ListNode prev = null;
while (fast != null) {
prev = slow;
slow = slow.next;
fast = fast.next;
}
// 上一节点的next指针绕过 待删除节点slow 直接指向slow的下一节点
prev.next = slow.next;
return dummy.next;
}
}
LeetCode_19:删除链表的第N个节点:Java
最新推荐文章于 2024-07-26 01:21:03 发布