查找倒数第k个节点，只遍历一遍

/*15：查找倒数第k个节点(要求只能遍历一次)*/
single_list_node* find_Reverse_order_nth_number(single_list_node* head, int n)
{
	int i = 0;
	single_list_node* p1 = head, *p2 = head;

	if(n <=0)
	{
		printf("input %d is InValid.\n",n);
		return NULL;
	}
	while(p1 != NULL)
	{
		++i;
		if(i == n)
		{
			break;
		}
		p1 = p1->next;
	}
	if(i != n)
	{
		printf("The List's Length is less than n = %d\n", n);
		return NULL;
	}
	while(p1->next != NULL)
	{
		p1 = p1->next;
		p2 = p2->next;
	}

	return p2;
}