LeetCode练习8： 删除链表的倒数第 N 个结点

LeetCode链接：力扣

题目：

给你一个链表，删除链表的倒数第 n 个结点，并且返回链表的头结点。

示例一：

输入：head = [1,2,3,4,5], n = 2
输出：[1,2,3,5]

代码：

/**
 * 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);
        dummyHead.next = head;
        ListNode slow = dummyHead;
        ListNode fast = head;
        
        //快指针先走n个节点
        for(int i = 0; i < n; ++i){
            fast = fast.next;
        }
        //快慢指针同时走，到快指针指向null时停下
        while(fast != null){
            fast = fast.next;
            slow = slow.next;
        }
        //慢指针指向下下个，调过倒数第n个节点
        slow.next = slow.next.next;
        return dummyHead.next;  //删掉虚拟头节点
    }
}