typedef struct node { int data; struct node*next; }Linklist; typedef struct { int elem[max]; int length; }Seqlist; int Locate(Linklist &L,int x) { int count=0; Linklist*p=&L; while(p) { if(p->data==x) return count; p=p->next; count++; } return 0; }
typedef struct node { int data; struct node*next; }Linklist; typedef struct { int elem[max]; int length; }Seqlist; int Locate(Linklist &L,int x) { int count=0; Linklist*p=&L; while(p) { if(p->data==x) return count; p=p->next; count++; } return 0; }