LeetCode 19. Remove Nth Node From End of List JAVA删除链表倒数第N个

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.

用两个链表,一个当尺子，一个修改！

class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
         if(head == null) {
            return null;
        }

        ListNode p = head;
        ListNode q = head;

        for(int i=0;i<n;i++) {
            q = q.next;
        }

        if(q == null) {
            head = head.next;
            return head;
        }

        while(q.next != null) {
            p = p.next;
            q = q.next;
        }
        p.next = p.next.next;
        return head;
    }
        
}