题目描述
题目地址:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/
给你一个链表,删除链表的倒数第 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
解法(JAVA)
/**
* 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(0,head); //建立虚拟头节点
// 建立双指针,均指向虚拟头节点
ListNode fast = dummy;
ListNode slow = dummy;
// fast指针先走n步
while(n-- > 0)
{
fast = fast.next;
}
ListNode pre = null;
while(fast != null)
{
pre = slow; //pre用来指向slow前一个结点
slow = slow.next; //slow前进一步
fast = fast.next; //fast前进一步
}
// 此时fast指向空,slow指向待删除节点,pre指向slow前一个结点
pre.next = slow.next;
slow.next = null; // slow后续指向空
return dummy.next;
}
}
Github分享
https://github.com/zhzz1996