程序员算法之找出链表的第K个结点

#include <stdio.h>
#include <stdlib.h>

typedef struct Lode{
    int elem;
    struct Lode *pnext;
}LNODE, *List;

/**
**创建一个链表
**/
void CreateList(List &L,int n)
{
    L = (struct Lode*)malloc(sizeof(List));
    L->pnext = NULL;
    
    int num;
    for(int i = 1;i <= n;i++)
    {
        scanf("%d",&num);
        List p = (struct Lode*)malloc(sizeof(List));
        p->elem = num;
        p->pnext = L->pnext;
        L->pnext = p;    
    }
}

List FindK(List L,int k)
{
    List pbegin = L;
    List pend = L;
    for(int i= 0;i < k;++i)
    {
        if(pbegin->pnext != NULL) pbegin = pbegin->pnext;
    }
    while(pbegin->pnext != NULL)
    {
        pbegin = pbegin->pnext;
        pend = pend->pnext;
    }
    return pend;
    
}
int main()
{
    List L;
    CreateList(L,10);
    List ptemp = FindK(L,4);
    printf("%d",ptemp->elem);
    return 0;
}