线性表的建立，删除，查找

#include<cstdio> #include<iostream>using namespace std;#define InitSize 10000typedef struct {int *data;int length;}SeqList;void ListInsert(SeqList &L,int i,int e){int j;for(j=L.length;j>=i;j--){L.data[j]=L.data[j-1];}L.data[j-1]=e;L.length++;}void ListDelete(SeqList &L,int i){for(int j=i;j<L.length;j++){L.data[j-1]=L.data[j];}L.length--;}void FindDelete(SeqList &L){for(int i=0;i<L.length;i++){    for(int k=i+1;k<L.length;k++)    {if(L.data[i]==L.data[k]){for(int j=k+1;j<L.length;j++){L.data[j-1]=L.data[j];}L.length--; }   }}}void pushback(SeqList &L,int e){int n=L.length;L.data[n]=e;L.length++;}int main(){int n;while(cin>>n){SeqList L;L.data=new int[InitSize];L.length=0; int temp;//scanf("%d",&n);for(int i=0;i<n;i++){scanf("%d",&temp);pushback(L,temp);}    int m;    scanf("%d",&m);    int i;    for(i=0;i<L.length;i++)    {    if(L.data[i]==m)    {    printf("YES\n");    break;}}if(i==L.length){printf("NO\n");}}/*for(int i=0;i<L.length-1;i++)printf("%d ",L.data[i]);printf("%d\n",L.data[L.length-1]);*/}