#include<iostream>
using namespace std;
typedef struct lnode{
char data;
struct lnode* next;
}lnode;
void createlist(lnode*& c,char a[],int n){
lnode*s,*r;
int i;
c=new lnode;
r=c;
for(i=0;i<n;i++){
s=new lnode;
s->data=a[i];
r->next=s;
r=r->next;
}
r->next=NULL;
}
bool finddata(lnode*c,char data){
lnode *p=c;
while(p->next!=NULL){
if(p->next->data==data)
break;
p=p->next;
}
if(p->next==NULL){
return false;
}
else if(p->next->data==data)
return true;
}
void putdata(lnode*c){
lnode *p=c;
while(p->next!=NULL){
cout<<p->next->data<<" ";
p=p->next;
}
}
int main()
{
lnode *head;
char a[100];
int n;
cout<<"请输入数组的大小:"<<endl;
cin>>n;
cout<<"请输入数组的元素值:"<<endl;
for(int i=0;i<n;i++){
cin>>a[i];
}
createlist(head,a,n);
cout<<"请输入链表的数值"<<endl;
putdata(head);
cout<<endl;
cout<<"请输入要查找的数值:"<<endl;
char data;
cin>>data;
if(finddata(head,data))
cout<<"有"<<data<<"这个数值!"<<endl;
else
cout<<"没这个数值!";
return 0;
}