字符倒序输出.txt

来自「递归算法」· 文本 代码 · 共 33 行

#include<iostream.h>
int jay(char a[],int i)
{
	if(i<0)
	{
		cout<<"break"<<endl;
	    return 0;
	}
	else
	{
		cout<<a[i]<<endl;
		jay(a,i-1);
		return 1;
	}
}
void main()
{
	char b[100];
	int i=0,j;
	while(i<99)
	{
		cout<<"please enter charter:"<<endl;
		cin>>b[i];
        if(b[i]=='#')
			break;
		i++;
	}
	j=jay(b,i);
    if(j==1)
		cout<<"ok"<<endl;
	else
		cout<<"error"<<endl;
}