算法题11 字符串的所有对称子串

int SymmtricSubStrings(char* str,vector<string>& vSubStrs)
{
if (str==NULL)
{
return -1;
}
string s=str;

//遍历字符串
char* p=str+1;
while (*p!='\0')
{
//odd nums
char* pre=p-1;
char* next=p+1;
int len=1;
while (pre>=str&&*next!='\0'&&*pre==*next)
{
len=len+2;
pre--;
next++;
}
if (len>1)
{
vSubStrs.push_back(s.substr(pre-str+1,len));
}

//even nums
pre=p-1;
next=p;
len=0;
while (pre>=str&&*next!='\0'&&*pre==*next)
{
len=len+2;
pre--;
next++;
}
if (len>1)
{
vSubStrs.push_back(s.substr(pre-str+1,len));
}

p++;
}

return 0;

}