Leetcode刷题记——19. Remove Nth Node From End of List(删除链表倒数第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.

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

二、解题思路：

题是非常非常easy的，为什么只挑easy的题做呀?呃呃呃，偷个懒，喵喵喵~解题思路：首先因为是单向的链表所以删除倒数的第几项不好掌控呀，所以先遍历链表得到链表长度，然后减个n，问题就转化成为删除第N项了。

（1）把删除倒数第n项转换为删除正数第n项

（2）注意删除第一项的情况以及链表为空的情况

三、源源源码（我不结巴，这只是卖萌）：

/**
 * 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)
    {
    	ListNode node = head;
    	ListNode node2 = head;
    	int q = 0;
    	
        while(node != null)
        {
        	q++;
        	node = node.next;
        	
        }
        if (q == n) {head = head.next; return head;}
        if (q == 0) {return null;}
        for (int i = 1; i < q-n; i++)
        {
        	node2 = node2.next;
        }
        node2.next = node2.next.next;
        return head;
    }
    public void print(ListNode root)   
    {  
                System.out.print(root.val + "\t");  
                if (root.next != null)  
                    print(root.next);  
    }  
    public static void main(String args[])  
    {  
        ListNode l1 = new ListNode(2);  
        ListNode a = l1;  
        a.next = new ListNode(4);  
        a = a.next;  
        a.next = new ListNode(3);  
        //b.next = new ListNode(4);  
        Solution s = new Solution();  
        s.print(s.removeNthFromEnd(l1,1));  
        //s.print(l1);  
    }  
}