Remove Nth Node from End of List Leetcode Java

Describe
Given A linked list, remove the N
Th node from the end of a list and return its head.
For example, Given linked list:1->2->3->4->5, and n = 2.
Aer removing the second node from the end, the linked list becomes 1->2->3->5.
Note:
? Given n would always be valid.
? Try to do the in one pass.
Analysis
Code

1  Public StaticListNode Removenthnodefromend (ListNode head,intN) {2         if(Head = =NULL|| n = = 0)3             returnhead;4ListNode fast = head, slow = head, p =head;5         intLen = 1;6          while(P.next! =NULL) {7p =P.next;8len++;9         }Ten         if(n = =Len) { One             returnHead.next; A         } -n = n%Len; -          for(inti = 0; I < len-n-1; i++) { theFast = Fast.next;//fast will go 1 more than I -         } -slow =Fast.next; -Fast.next =Slow.next; +         returnhead; -}

Remove Nth Node from End of List Leetcode Java