19. Remove Nth Node From End of List

Given a linked list, remove the n-th node from the end of list and return its head.

Example:

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.
Note:

Given n will always be valid.

Follow up:

Could you do this in one pass?

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode l = new ListNode(0);
        l.next = head;
        int length = 0;
        ListNode p = head;
        while(p!=null){
            p=p.next;
            length++;
        }
        int num = length - n;
        p = l;
        while(num>0){
            num--;
            p=p.next;
        }
        p.next = p.next.next;
        return l.next;
    }
}

//双指针

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode l = new ListNode(0);
        l.next = head;
        ListNode pn = l;
        ListNode pp = l;
        for(int i=0; i<n+1; ++i){
            pn = pn.next;
        }
        while(pn!=null){
            pn = pn.next;
            pp = pp.next;
        }
        pp.next = pp.next.next;
        return l.next;
    }
}

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode pn = head;
        ListNode pp = head;
        if(head == null) return head;
        for(int i=0; i<n+1; ++i){
            if(pn == null){
                return head.next; //删除倒数第n个数且共有n个数即第一个数
            }else{
                pn = pn.next;
            }
        }
        while(pn!=null){
            pn = pn.next;
            pp = pp.next;
        }
        pp.next = pp.next.next;
        return head;
    }
}