急求用单链表查找链表中的某些字符串和另一个链表相等的字符串
列:链表一“abg gaa acd gad"
链表二"adagd abg adfg aga"
空白处为空格在链表二中有“abg”字符串与链表一中相同
我又下面的程序,但是不知道什么地方出啦问题
#include<iostream>
typedef struct pointer{
char dat;
struct pointer *link;
}pointer;
void bingNum(pointer *head1,pointer *head2,int m,int n);
//输入链表
int readdata(pointer *head){
pointer *p;
char tmp;
int i=1;
printf("input data:\n"); //只能输入如"abg dgc aga!"的字符串
scanf("%c",&tmp);
if(tmp==NULL) i=0;
else while(tmp!='!')
{
if(tmp==' ') i++;
p=(pointer *)malloc(sizeof(struct pointer));
p->dat=tmp;
p->link=head->link;
head->link=p;
scanf("%c",&tmp);
}
cout<<"集合的元素数:"<<i<<endl;
return i;
}
void disp(pointer *head){
pointer *p;
p=head->link;
printf("{");
while(p!=NULL)
{
if(p->dat!=' '){
printf("%c",p->dat);
p=p->link;}
else{
p=p->link;
printf(",");}
}
printf("}");
printf("\n");
}
void bingNum(pointer *head1,pointer *head2,int m,int n)
{
pointer *p1,*p2;
int k=m,j=n,i=0,l=k+j-i,c=0;
p1=head1->link;
p2=head2->link;
while(p1!=NULL&&p2!=NULL)
{
if(p1->dat!=p2->dat)
l--;
while(p1!=NULL&&p2!=NULL){
p1=p1->link;p2=p2->link;
if(p1->dat==' '&&p2->dat==' ')
{p1=p1->link;p2=p2->link;break;}
}
}
cout<<l<<endl;
}
void main()
{
pointer *head1,*head2;
int n1,n2;
head1=(pointer *)malloc(sizeof(struct pointer));
head1->link=NULL;
head2=(pointer *)malloc(sizeof(struct pointer));
head2->link=NULL;
printf("输入集合1:\n");
n1=readdata(head1);
printf("输入集合2:\n");
n2=readdata(head2);
printf("\n集合1为:\n");
disp(head1);
printf("\n集合2为:\n");
disp(head2);
bingNum(head1,head2,n1,n2);
}
链表二"adagd abg adfg aga"
空白处为空格在链表二中有“abg”字符串与链表一中相同
我又下面的程序,但是不知道什么地方出啦问题
#include<iostream>
typedef struct pointer{
char dat;
struct pointer *link;
}pointer;
void bingNum(pointer *head1,pointer *head2,int m,int n);
//输入链表
int readdata(pointer *head){
pointer *p;
char tmp;
int i=1;
printf("input data:\n"); //只能输入如"abg dgc aga!"的字符串
scanf("%c",&tmp);
if(tmp==NULL) i=0;
else while(tmp!='!')
{
if(tmp==' ') i++;
p=(pointer *)malloc(sizeof(struct pointer));
p->dat=tmp;
p->link=head->link;
head->link=p;
scanf("%c",&tmp);
}
cout<<"集合的元素数:"<<i<<endl;
return i;
}
void disp(pointer *head){
pointer *p;
p=head->link;
printf("{");
while(p!=NULL)
{
if(p->dat!=' '){
printf("%c",p->dat);
p=p->link;}
else{
p=p->link;
printf(",");}
}
printf("}");
printf("\n");
}
void bingNum(pointer *head1,pointer *head2,int m,int n)
{
pointer *p1,*p2;
int k=m,j=n,i=0,l=k+j-i,c=0;
p1=head1->link;
p2=head2->link;
while(p1!=NULL&&p2!=NULL)
{
if(p1->dat!=p2->dat)
l--;
while(p1!=NULL&&p2!=NULL){
p1=p1->link;p2=p2->link;
if(p1->dat==' '&&p2->dat==' ')
{p1=p1->link;p2=p2->link;break;}
}
}
cout<<l<<endl;
}
void main()
{
pointer *head1,*head2;
int n1,n2;
head1=(pointer *)malloc(sizeof(struct pointer));
head1->link=NULL;
head2=(pointer *)malloc(sizeof(struct pointer));
head2->link=NULL;
printf("输入集合1:\n");
n1=readdata(head1);
printf("输入集合2:\n");
n2=readdata(head2);
printf("\n集合1为:\n");
disp(head1);
printf("\n集合2为:\n");
disp(head2);
bingNum(head1,head2,n1,n2);
}
...全文


新手乐园
