习题3.2

#include<stdio.h>
#include<stdlib.h>
struct Node;
typedef struct Node *ptrToNode ;
typedef struct PtrToNode List;
typedef struct PtrToNode Position;

struct Node{
    ElementType Ele;
    PtrToNode Next;
};

void
PrintLots(List L, List p)
{
    int bef = 0;
    ElementType Tmp;
    Position ptr1,Ptr2;
    Ptr1 = p; Ptr2 = L;
    while( Ptr1->Next != NULL )
    {
        int i;
        Tmp = Ptr1->Next->Ele;
        for( i = 0; i < Tmp - bef; i++)
        {
            Ptr2 = Ptr2->Next;
        }
        printf("%d",Ptr2->Ele);
        Ptr1 = Ptr1->Next;
        bef = Tmp;
    }
}

void
PrintLots( List L, List P )
{
    Position Ppos,Lpos;
    Ppos = First(P); Lpos =First(L);
    int counter = 1;
    while( Ppos != NULL && Lpos != NULL )
    {
        if( Ppos->Ele == couter++)//counter的值和Lpos所指向位置的序数相等
        {
            Ppos = next( Ppos, P );
            printf("%?",Lpos->Ele);
        }
        Lpos = next( Lpos,L );
    }
}