用链表实现:将字符串t复制到字符串s的末端,并且返回新的字符串的首地址,并编写主程序输出。
例:(括号内为说明)
输入abc def
输出abcdef
#include <iostream>
#include <string>
using namespace std;
struct str{
char c;
struct str *next;
};
struct str *s,*t,*head;
int main(){
struct str *f(struct str *s,struct str *t);
s=f(s,t);
while(s!=NULL){
cout<<s->c;
s=s->next;
}
return 0;
}
struct str *f(struct str *s,struct str *t){
head=s=new str;
cin>>s->c;
while(s->c!='/n'){
s=s->next=new str;
cin>>s->c;
}
t=s->next=new str;
cin>>t->c;
while(t->c!='/n'){
t=t->next=new str;
cin>>t->c;
}
return head;
}
=====================================
运行后一直在输入。。。不知道哪里错了
struct str *f(struct str *s,struct str *t){
head=s=new str;
cin>>s->c;
while(s->c!='\n'){
s=s->next=new str;
cin>>s->c;
}
t=s;
cin>>t->c;
while(t->c!='\n'){
t=t->next=new str;
cin>>t->c;
}
t=NULL;
return head;
}
这是改的,可还是一直输入。。。