19. Remove Nth Node From End of List

题目：

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.

解法

java:

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

python:

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def removeNthFromEnd(self, head, n):
        """
        :type head: ListNode
        :type n: int
        :rtype: ListNode
        """
        # get length L first:
        L=0; p=head;
        while p != None:
            L+=1
            p = p.next
        # remove the (L+1-n)-th node
        i=0; 
        dup = ListNode(0); dup.next = head; p=dup;
        while i<L-n and p.next != None:
            p=p.next
            i+=1
        # delete p.next
        p.next = p.next.next
        return dup.next