剑指offor面试题15：链表中倒数第k个结点

typedef struct Node
{
	int value;
	Node* next;
}node;

void recKList(Node* Head,int num)
{
	Node* p = Head;//快指针，先走num步
	Node* q = Head;//慢指针，等p先走了num步，再开始走
	int n = num;

	if (Head == NULL)
	{
		return;
	}
	for (int i = 0; i < n-1; i++)
	{
		p = p->next;
	}

	while (p ->next!= NULL)
	{
		p = p->next;
		q = q->next;
	}

	printf("倒数第%d个数是%d\n", num, q->value);
}