输出单链表倒数第K个结点值

#include<cstdio>
#include<cstdlib>
#include<iostream>
using namespace std;
typedef struct Node
{
	int x;
	Node *next;
}Node;
int main()
{
	int k=0,IsF1=0;
	scanf("%d",&k);
	getchar();
	int num=0,z=0;
	string s;
	getline(cin,s);
	Node *head=(Node*)malloc(sizeof(Node));
	head->next=NULL;
	Node *ne;
	while(1)
	 {
	 	if(s[z]==‘\0‘)
	 	{
	 		ne=(Node*)malloc(sizeof(Node));
	 		ne->x=num;
	 		ne->next=head->next;
	 		head->next=ne;
	 		break;
		 }
	 	if(s[z]>=‘0‘&&s[z]<=‘9‘)
	 	 {
	 	 	IsF1=1;
		 	num*=10;
		 	num+=s[z]-‘0‘;
		 }
	 	if(s[z]==‘ ‘)
	 	 {
	 	 	if (IsF1)
	 	 	{
	 	 		ne=(Node*)malloc(sizeof(Node));
	 			ne->x=num;
	 			ne->next=head->next;
	 			head->next=ne;
			  }
			num=0;
		  }
		z++;
	 }
	int j=1;
	for(Node *i=head->next;i!=NULL;i=i->next,++j)
	 {
	 	if (j==k)
	 	 {
	 	 	printf("%d",i->x);
	 	 	return 0;
		  }
	 }
	printf("Not Found");
	return 0;
}