笔试题判断字符串是否是回文

<span style="font-size:18px;">#include <iostream>
using namespace std ;

int IsRevStr(char *str )
{
int i,len ;
int found = 1 ;    //1表示是回文 0则不是

if(str == NULL)
{
return -1 ;
}
len = strlen(str) ;
for(i = 0 ;i<len/2;i++)  //遍历中如果发现相应的头尾字符串不等，则字符串不是回文
{
if(*(str+1) != *(str+len-i-1))
{
found = 0 ;
break ;
}
}
return found ;
}

int main()
{
char str1[10] = "1234321" ;
char str2[10] = "1234221" ;

int test1 = IsRevStr(str1) ;
int test2 = IsRevStr(str2) ;

cout<<"str1 is "<<(test1 == 1 ? "" : "not")<<"reverse string."<<endl ;

cout<<"str2 is "<<(test2 == 1 ? "" : "not")<<"reverse string."<<endl ;

return 0 ;
} </span>