学步园

 #include <stdio.h><br /> #include <stdlib.h><br /> #include <malloc.h></p> <p>#define OK 1<br /> #define ERROR 0<br /> #define TRUE 1<br /> #define FALSE 0</p> <p>#define ElemType int<br /> #define MAXSIZE 100 /*此处的宏定义常量表示线性表可能达到的最大长度*/<br /> typedef struct<br /> {<br /> ElemType elem[MAXSIZE]; /*线性表占用的数组空间*/<br /> int last; /*记录线性表中最后一个元素在数组elem[ ]中的位置（下标值），空表置为-1*/<br /> }SeqList;</p> <p>/*查找函数实现*/<br /> int Locate(SeqList L, ElemType e)<br /> {<br /> int i=0; /*i为扫描计数器，初值为0，即从第一个元素开始比较*/<br /> while ((i<=L.last)&&(L.elem[i]!=e)) i++; /*顺序扫描表，直到找到值为key的元素, 或扫描到表尾而没找到*/<br /> if (i<=L.last)return(i+1); /*若找到值为e的元素，则返回其序号*/<br /> else return(-1); /*若没找到，则返回空序号*/<br /> }</p> <p>void main()<br /> {<br /> SeqList l;<br /> int p,q,r;<br /> int i;<br /> printf("Please input the length of SeqList:");<br /> scanf("%d",&r);<br /> l.last = r-1;<br /> printf("Please input the each number of SeqList:/n");<br /> for(i=0; i<=l.last; i++)<br /> {<br /> scanf("%d",&l.elem[i]);<br /> }<br /> printf("please input the number which you want to find:/n");<br /> scanf("%d",&q);<br /> p=Locate(l,q);<br /> if(p == -1) printf("there is no number in the SeqList!/n");<br /> else printf("The number which you want to find is at the place of :%d/n",p);<br /> }<br />