链表操作--- Remove Nth Node From End of List，注意事项整理

  Given linked list: 1->2->3->4->5, and n = 2.

   After removing the second node from the end, the linked list becomes 1->2->3->5.

从尾端删除第n个节点。

（1）获取总的链表长度，L根据n带入(L−n+1)求出从第一个节点开始数要删除的节点。

public ListNode removeNthFromEnd(ListNode head, int n) {
    ListNode dummy = new ListNode(0);//1、在first节点前增加一个节点，防止仅有一个节点时有误
    dummy.next = head;
    int length  = 0;
    ListNode first = head;
    while (first != null) {
        length++;//获取所有节点的长度，包含了加入的判断节点
        first = first.next;
    }
    length -= n;
    first = dummy;
    while (length > 0) {
        length--;
        first = first.next;//循环到要删除节点的上一个节点
    }
    first.next = first.next.next;
    return dummy.next;//2、返回first节点
}

两个while循环分别执行L，L-N次，时间复杂度O(L)；

（2）分别设定两个指针，指向头节点，第一个指针后移n-1，然后再通过第一个指针是否为空，判断第二个

指针节点位置，正好为删除节点位置。其实跟上边通过length循环查找时一样的，都做了length - n次循环

public ListNode removeNthFromEnd(ListNode head, int n) {
    ListNode dummy = new ListNode(0);
    dummy.next = head;
    ListNode first = dummy;
    ListNode second = dummy;
    // Advances first pointer so that the gap between first and second is n nodes apart
    for (int i = 1; i <= n + 1; i++) {
        first = first.next;
    }
    // Move first to the end, maintaining the gap
    while (first != null) {
        first = first.next;
        second = second.next;
    }
    second.next = second.next.next;
    return dummy.next;
}