LeetCode 19. Remove Nth Node From End of List

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 class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        if(n==0 || head==null ){   
            return head;
        }
        ListNode p=head;
        int count=0;
        while(p!=null){
            count++;
            p=p.next;
        }
        if(n==count){
            return head.next;
        }
        int err=count-n;
        p=head;
        int i=1;
        while(i<err){
            p=p.next;
            i++;
        }
        p.next=p.next.next;
        return head;
    }
}