leetcode Remove Nth Node From End of List java编程学习(七)

一.题目

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.

Note:
Given n will always be valid.
Try to do this in one pass.

二. 代码

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        if(head == null)  
             return null;  
         ListNode p = head, q = head;  
         for(int i = 0; i < n; i++)  
          {  
    	     if(q == null)
    		    return null;
             q = q.next;  
         }  
         if(q==null)
           return p.next;

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

  主要是算法思想.

  自己时不时反糊涂 if和while不分.