输入一个单向链表，输出该链表中倒数第k个结点

题目：输入一个单向链表，输出该链表中倒数第k个结点。链表的倒数第0个结点为链表的尾指针。

#include "stdio.h"
#include "stdlib.h"

typedef struct LNode{

	int data;
	struct LNode *next;
}LNode;


void CreateListR(LNode *&C, int a[], int n){
	
	LNode *s, *r;

	C = (LNode *)malloc(sizeof(LNode));
	C ->next = NULL;
	
	r = C;

	for(int i=0; i<n; ++i){
		s = (LNode *)malloc(sizeof(LNode));
		s->data = a[i];

		r->next = s;
		r = r->next;
	}

	r->next = NULL;

}


void PrintList(LNode *head){
	
	while(head->next != NULL){
		head = head->next;
		printf("%d ", head->data);
	
	}
	
	putchar('\n');

}



LNode *FindLastKNode(LNode *p, int k){

	LNode *f, *l;

	f = l = p->next;
	
	int n = k-1;
	while(n > 0){
		--n;
		f = f->next;

		if(f == NULL){
			printf("The param 'k' is larger than length of LinkedList.");
			return NULL;
		}
	}

	
	while(f->next != NULL){
		f = f->next;
		l = l->next;
	}

	return l;

}
 
void main(){

	int R[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};

	LNode *head;
	CreateListR(head, R, 10);
	
	LNode *l;
	int k = 4;
	l = FindLastKNode(head, 3);

	printf("%d \n", l->data);

}