【Leetcode -19】Remove Nth Node From End of List

【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.

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.

Follow up:

Could you do this in one pass?

public class Solution19 {
	   class ListNode {
		      int val;
		      ListNode next;
		      ListNode(int x) { val = x; }
	   }
	   public ListNode removeNthFromEnd(ListNode head, int n) {
			  if(n==0) {
				   return  head;
			   }
			  
	           if(head.next==null&&n==1){
	               return null;
	           }
	           if(head.next.next==null){
	              if(n==1){
	                 head.next=null;
	                  return head;
	              } else if(n==2){
	                  return head.next;
	              }
	           }

	          ListNode[] nodes=new ListNode[n+1];
			  nodes[0]=head;//node[0]始终指向要删除节点的前一个节点
	           for(int i=1;i<n+1;i++) {
				  nodes[i]=nodes[i-1].next;
				
			   }
	           if(nodes[n]==null){
	               return head.next;
	           }
			  while(nodes[n].next!=null) {
				  //各指针依次下移
	               for(int j=0;j<=n;j++) {
	                  nodes[j]=nodes[j].next;
	                
				   }
			 }

			  //nodes[n].next=null;
	          if(n>1){
			  nodes[0].next=nodes[2];
	          }else{
	              nodes[0].next=null;
	          }
			  return head;
			   
			   
			
		        
		    }

}