Remove Nth Node From End of List

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.

第一次接触链表的题，虽然道理都懂，可是写起来就很晕，希望多练习之后可以弄明白吧。。

链表的面试题据说百分之八十都可以用递归和两指针来做。

题目：删除链表倒数第n个元素

思路：定义两个指针，使它们之间相隔n个节点，每次两个指针都向后移动一位，当后面的指针没有后继之后，

前面的指针所指的位置就是要删除的节点。

/**
 * 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;
        ListNode q = head;
        for (int i = 0; i < n; i++) {
			q = q.next;
		}
        if (q == null) {
			head = head.next;
			p = null;
			return head;
		}
        while (q.next != null) {
			p = p.next;
			q = q.next;
		}
        ListNode tmp = p.next.next;
        p.next = tmp;
        return head;
    }
}

下面是在本地IDE上编译测试时的代码，因为刚开始接触链表，自己写的时候测试都不会写。。。。

PS：链表的基本操作可以参考http://blog.csdn.net/jianyuerensheng/article/details/51200274。大神写的很详细。

import java.util.LinkedList;

class ListNode{
	int val;
	ListNode next;
	public ListNode(int x) {
		// TODO Auto-generated constructor stub
		val = x;
	}
}
public class RemoveNthNodeFromEndofList {
	public static void main(String[] args) {
		ListNode pHead = null;
		ListNode p = null;
		for (int i = 1; i <= 5; i++) {//往链表里存数据
			ListNode list = new ListNode(i);
			if (p == null) {
				p = list;
				pHead = list;
			} else {
				p.next = list;
				p = list;
			}
		}

		printList(pHead);//打印删除前
		
		printList(removeNthFromEnd(pHead, 2));//打印删除后
	}
	public static ListNode removeNthFromEnd(ListNode head, int n) {
        if (head == null) {
			return null;
		}
        ListNode p = head;
        ListNode q = head;
        for (int i = 0; i < n; i++) {
			q = q.next;
		}
        if (q == null) {
			head = head.next;
			p = null;
			return head;
		}
        
        while (q.next != null) {
			p = p.next;
			q = q.next;
		}
        ListNode tmp = p.next.next;
        p.next = tmp;
        return head;
    }
	public static void printList(ListNode head) {
		if (head == null) {
			return;
		}
		ListNode p = head;
		do {
			System.out.print(p.val + "->");
			p = p.next;
		} while (p != null);
		System.out.println();
	}
}