字符串判断 c++递归版本:
#include <iostream>
using namespace std;
int fun(int low, int high, char *str, int length)
{
if (length == 0 || length == 1)
return 1;
if (str[low] != str[high])
return 0;
return fun(low+1, high-1, str, length-2);
}
int main()
{
char str[]="aaabdaaa";
int length = strlen(str);
//返回1代表是, 0代表不是
cout << fun(0, length-1, str, length) << endl;
return 0;
}
整型判断:五位正整数判断是否为回文正数
main( )
{
long ge,shi,qian,wan,x;
scanf("%ld",&x);
wan=x/10000; x=x%10000
qian=x/1000; x=x%1000;x=x%100
shi=x /10; x=x%10;
ge=x ;
if (ge==wan&&shi==qian)/*
个位等于万位并且十位等于千位
*/
printf("this number is a huiwen\n");
else
printf("this number is not a huiwen\n");
}