返回信息流代码的质量不高，但非常想知道最后一个test case没通过的原因在哪里
```
class Solution {
public:
string longestPalindrome(string s) {
int n = s.length();
int maxlen = 1,x = 0;
if(n<2) return s;
string rs(s);
reverse(rs.begin(),rs.end());
int c[n+1][n+1];
for(int i = 0;i<n+1;i++){
c[i][0] = 0;
}
for(int i = 0;i<n+1;i++){
c[0][i] = 0;
}
for(int i = 1;i<n+1;i++){
for(int j=1;j<n+1;j++){
if(s[i-1] == rs[j-1]){
c[i][j] = c[i-1][j-1]+1;
if(c[i][j]>maxlen){
maxlen = c[i][j];
x = i-1;
}
}else {
c[i][j] = 0;
}
}
}
return s.substr(x-maxlen+1,maxlen);
}
};
```
最后一个test case：
"esbtzjaaijqkgmtaajpsdfiqtvxsgfvijpxrvxgfumsuprzlyvhclgkhccmcnquukivlpnjlfteljvykbddtrpmxzcrdqinsnlsteonhcegtkoszzonkwjevlasgjlcquzuhdmmkhfniozhuphcfkeobturbuoefhmtgcvhlsezvkpgfebbdbhiuwdcftenihseorykdguoqotqyscwymtjejpdzqepjkadtftzwebxwyuqwyeegwxhroaaymusddwnjkvsvrwwsmolmidoybsotaqufhepinkkxicvzrgbgsarmizugbvtzfxghkhthzpuetufqvigmyhmlsgfaaqmmlblxbqxpluhaawqkdluwfirfngbhdkjjyfsxglsnakskcbsyafqpwmwmoxjwlhjduayqyzmpkmrjhbqyhongfdxmuwaqgjkcpatgbrqdllbzodnrifvhcfvgbixbwywanivsdjnbrgskyifgvksadvgzzzuogzcukskjxbohofdimkmyqypyuexypwnjlrfpbtkqyngvxjcwvngmilgwbpcsseoywetatfjijsbcekaixvqreelnlmdonknmxerjjhvmqiztsgjkijjtcyetuygqgsikxctvpxrqtuhxreidhwcklkkjayvqdzqqapgdqaapefzjfngdvjsiiivnkfimqkkucltgavwlakcfyhnpgmqxgfyjziliyqhugphhjtlllgtlcsibfdktzhcfuallqlonbsgyyvvyarvaxmchtyrtkgekkmhejwvsuumhcfcyncgeqtltfmhtlsfswaqpmwpjwgvksvazhwyrzwhyjjdbphhjcmurdcgtbvpkhbkpirhysrpcrntetacyfvgjivhaxgpqhbjahruuejdmaghoaquhiafjqaionbrjbjksxaezosxqmncejjptcksnoq"
正确答案："yvvy"
本代码输出："cltg"
这是一条镜像帖。来源：北邮人论坛 / acm-icpc / #90985同步于 2016/9/7
该镜像源已超过 30 天没有更新，可能在源站已被删除。
ACM_ICPC机器人发帖
leetcode最长回文子串：87 / 88 test cases passed？求大家帮找
byr10086
2016/9/7镜像同步1 回复
订阅后，新回复会通过你的通知中心匿名送达。
1 条回复