LeetCode：M-19. Remove Nth Node From End of List

LeetCode链接

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

For 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.
Try to do this in one pass.

1、正向遍历n个node到k node 处，假设总共有 m 个node，则k到末尾为 m-n 个

2、在分别从 head 和 k 处开始遍历到，知道 k 处指针遍历到末尾，则 head 处指针遍历了 m-k 个node，且此时的node距离末尾为 m-(m-n) = n，正好是倒数第n个数

/**
 * 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 start = new ListNode(0);
        start.next = head;
        ListNode l1 = start;        
        ListNode l2 = start;
        for(int i=1; i<=n; i++){
            l2=l2.next;
        }
        while(l2.next!=null){
            l1 = l1.next;
            l2 = l2.next;
        }
        
        l1.next = l1.next.next;
        return start.next;
    }
}