题意:输入一行字符串,以#号为结束标记,通过递归实现字符串逆序存储
题解:思想:边输入便存储,调用递归,实现“压栈”操作,最先输入最后进字符串;
#include <iostream>
using namespace std;
void reserve(char *s){
static int i=0;
char ch;
cin>>ch;
if(ch!='#'){
reserve(s);
s[i++]=ch;
}
s[i]='\0';
}
int main()
{
char *s;
s=new char[1000];
cout<<"请输入字符串:";
reserve(s);
cout<<"逆置后的字符串为:";
cout<<s<<endl;
}