Remove Nth Node From End of List LeetCode Java

描述
Given a linked list, remove the n
th 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.
分析
代码

public static ListNode removeNthNodeFromEnd(ListNode head, int n) {
        if (head == null || n == 0)
            return head;
        ListNode fast = head, slow = head, p = head;
        int len = 1;
        while (p.next != null) {
            p = p.next;
            len++;
        }
        if (n == len) {
            return head.next;
        }
        n = n % len;
        for (int i = 0; i < len - n - 1; i++) {
            fast = fast.next; // fast会比i多进1
        }
        slow = fast.next;
        fast.next = slow.next;
        return head;
    }