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.

解答这道题主要用了快慢指针的方式。完成一遍遍历。

答案：

class ListNode {
		int val;
		ListNode next;
		ListNode(int x) {
			val = x;
			next = null;
		}
	}
	
	public ListNode removeNthFromEnd(ListNode head, int n) {
		if(n <=0 ) {
			return null;
		}
		ListNode fast = head;
		ListNode slow = head;
		ListNode preSlow = head;

		while(n-- > 1) {
			fast = fast.next;
		}
		
		while(fast.next != null) {
			fast = fast.next;
			preSlow = slow;
			slow = slow.next;
		}
		if( slow == head ) {
			return head.next;
		} else {
			preSlow.next = slow.next;
			return head;
		}
    }