public static LinkedListNode findKth(LinkedListNode n, int k) {
		if(k<1)
			return null;
		LinkedListNode quick, slow;
		quick = slow = n;
		int i;
		for(i = 1; i<=k && quick != null; i++ )
			quick = quick.next;
		
		if(i != k+1 )
			return null;
		
		while(quick!= null) {
			quick = quick.next;
			slow = slow.next;
		}
		return slow;
	}