用递归算法写一个函数,求字符串最长连续字符的长度,比如aaaabbcc的长度为4,aabb的长度为2,ab的长度为1。
int findContinuousCharacter(char *pStr)
{
// int nLength = strlen(pStr);
// if(nLength == 1) return 1;
{
// int nLength = strlen(pStr);
// if(nLength == 1) return 1;
if(*pStr == '\0') return 0;
if(*(pStr + 1) == '\0') return 1;
if(*pStr == *(pStr + 1)) return 1 + find(pStr + 1);
return find(pStr + 1);
}
int main()
{
char str[] = "daac";
cout<<find(str)<<endl;
{
char str[] = "daac";
cout<<find(str)<<endl;
}