flag8输出倒数第K个节点

# include <stdio.h>
# include <malloc.h>
typedef struct node
{
int data;
struct node* next;
}Node,*Pnode;
Pnode creatnode();
void travel(Pnode phead);
int idealnumber(Pnode phead,int i);
void main()
{
Pnode L=creatnode();
travel(L);
printf("\n%d\n",idealnumber(L,3));
}
Pnode creatnode()
{


Pnode phead=(Pnode)malloc(sizeof(Node));
phead->next=NULL;
Pnode ptail=phead;;
printf("input the number of the link\n");
int a,i;
scanf("%d",&a);
for(i=0;i<a;i++)
{
Pnode pnew=(Pnode)malloc(sizeof(Node));
printf("please inptut the %ded number\n",i+1);
scanf("%d",&(pnew->data));
pnew->next=NULL;
ptail->next=pnew;
ptail=pnew;
}
return phead;
}
void travel(Pnode phead)
{
Pnode L=phead->next;
while(L!=NULL)
{
printf("%d\n",L->data);
L=L->next;
}
}
int idealnumber(Pnode phead,int i)
{
Pnode pA=phead->next;
Pnode pB=phead->next;
int j;
for(j=0;j<i;j++)//重点，让pA先走
{
pA=pA->next;
}
while(pA!=NULL)//pA到重点，B恰好到要求的地方
{
pA=pA->next;
pB=pB->next;
}
//printf("%d\n",pB->next);
return pB->data;
}