java 对称字符串的最大长度_程序员面试题精选100题(46)-对称子字符串的最大长度...

int GetLongestSymmetricalLength_2(char* pString)

{

if(pString == NULL)

return 0;

int symmeticalLength = 1;

char* pChar = pString;

while(*pChar != '\0')

{

// Substrings with odd lengt

char* pFirst = pChar - 1;

char* pLast = pChar + 1;

while(pFirst >= pString && *pLast != '\0' && *pFirst == *pLast)

{

pFirst--;

pLast++;

}

int newLength = pLast - pFirst - 1;

if(newLength > symmeticalLength)

symmeticalLength = newLength;

// Substrings with even length

pFirst = pChar;

pLast = pChar + 1;

while(pFirst >= pString && *pLast != '\0' && *pFirst == *pLast)

{

pFirst--;

pLast++;

}

newLength = pLast - pFirst - 1;

if(newLength > symmeticalLength)

symmeticalLength = newLength;

pChar++;

}

return symmeticalLength;

}

分享到:

18e900b8666ce6f233d25ec02f95ee59.png

72dd548719f0ace4d5f9bca64e1d7715.png

2011-07-21 18:46

浏览 1314

评论

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值