数据结构与算法分析-c 练习 3-2 答案

#include "list.c"
#define FatalError(str) fprintf(stderr, "%s\n", str),exit(1);
void PrintLots(List L, List P)
{
    Position Lnext,Pnext;
    int n;

    if(IsEmpty(L)){
        FatalError("list is empty!!!");
    }
    n = 1;
    Lnext = L;
    Pnext = P;
    while((Lnext = Advance(Lnext)) != NULL){
        while((Pnext = Advance(Pnext)) != NULL){
            if(n++ == Lnext->Element){
                printf("%d\n", Pnext->Element);
                break;
            }
        }
        if(Lnext == NULL || Pnext == NULL){
            return;
        }
    }
}