删除链表中倒数第n个节点

给定一个链表，删除链表中倒数第n个节点，返回链表的头节点。
样例
给出链表1->2->3->4->5->null和 n = 2.

删除倒数第二个节点之后，这个链表将变成1->2->3->5->null.

挑战
O(n)时间复杂度

/**
 * Definition for ListNode.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int val) {
 *         this.val = val;
 *         this.next = null;
 *     }
 * }
 */ 
public class Solution {
    /**
     * @param head: The first node of linked list.
     * @param n: An integer.
     * @return: The head of linked list.
     */
    ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        ListNode pre = dummy;
        ListNode cur = head;
        ListNode next = head.next;
        ListNode node = head;
        for (int i = 0; i < n; i++) node = node.next;
        while (node != null) {
            node = node.next;
            next = next.next;
            cur = cur.next;
            pre = pre.next;
        }
        pre.next = next;
        return dummy.next;
    }
}