递归判断是否是回文（C++实现）

#include<string.h>
#include<iostream>
using namespace std;
int isPalindrome(int stat, int end, const char*str, int length) {
	if (NULL == str)
		return 0;
	if (0 == length || 1 == length)
		return 1;
	if (str[stat] != str[end])
		return 0;
	return isPalindrome(stat + 1, end - 1, str, length - 2);
}

int main() {
	char str[] = { "IhaveevahI" };
	int length = strlen(str);
	cout << isPalindrome(0, length - 1, str, length) << endl;
	return 0;
}

本程序编译环境是VS2017