删除链表的倒数第 N 个结点

 1.未通过代码

 public ListNode removeNthFromEnd(ListNode head, int n) {
       ListNode slow = head;
       ListNode quick = head;
       for (int i = 0; i < n; i++) {
            if(quick==null){
                return slow;
            }
            quick = quick.next;
       }
       ListNode last = new ListNode();
       while (quick!=null){
           if(quick.next==null){
               last = slow;
           }
           slow = slow.next;
           quick = quick.next;
       }
       last.next = slow.next;
       return head;
    }

用例

输入：

[1] 1

输出：

[1]

预期结果：

[]

采用虚拟头节点应对这种去除头节点的特殊逻辑

 

    public ListNode removeNthFromEnd2(ListNode head, int n) {
        ListNode dummyNode = new ListNode();
        dummyNode.next = head;
        ListNode slow = dummyNode;
        ListNode quick = dummyNode;
        // 初始化
        for (int i = 0;i<n;i++){
            if(quick==null){
                return head;
            }
            quick = quick.next;
        }
        while (quick.next!=null){
            slow = slow.next;
            quick = quick.next;
        }
        slow.next = slow.next.next;
        return dummyNode.next;
    }