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.

Solution:

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