1. 网址:http://sakakokiya.iteye.com/blog/735974
int find(char *str, int n) {
if(n<=1) return 1;
else if(str[0]==str[n-1]) return find(str+1, n-2);
else return 0;
}
int main(int argc, char* argv[]) {
char *str = “abcdedcba”;
printf(”%s: %s\n”, str, find(str, strlen(str)) ? “Yes” : “No”);
}
2. 网址:http://luisliu.blog.51cto.com/883990/229783/
#include <iostream>
using namespace std;
//将一整数逆序后放入一数组中(要求递归实现)
int IsRound(char *str,int len)
{
if(*str==*(str+len-1))
return IsRound(str+1,len-2);
if(len<=1)
return 1;
else
return 0;
}
int _tmain(int argc, _TCHAR* argv[])
{
char *str="abcdcba";
char *str2="abcdefg";
int sig=0;
sig = IsRound(str,strlen(str));
cout<<sig<<endl;
return 0;
}