leetcode - Longest Palindromic Substring
2013-04-26 15:48
344 查看
题目描述：点击此处
class Solution {
public:
int minInt (int a, int b){
return a<=b?a:b;
}
string longestPalindrome(string s) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
string rlt = "";
if (s.length()<=0)
return "";
int i, j;
int len = s.length();
for (i=0; i<len; i++){
int l = minInt (i+1, len-i-1);
int k = minInt (i, len-i-1);
if (2*l<=rlt.length() && 2*k+1<=rlt.length())
break;
for (j=0; j<l; j++){
if (s.at(i-j) != s.at(i+j+1))
break;
}
if (rlt.length()<j*2)
rlt = s.substr(i-j+1, j*2);
for (j=0; j<k; j++){
if (s.at(i-j-1) != s.at(i+j+1))
break;
}
if (rlt.length()<j*2+1)
rlt = s.substr(i-j, j*2+1);
}
return rlt;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode-java-5. Longest Palindromic Substring
- LeetCode Longest Palindromic Substring(最长回文子串)
- LeetCode （5）Longest Palindromic Substring
- 【LeetCode-面试算法经典-Java实现】【05-Longest Palindromic Substring(最大回文字符串)】
- Longest Palindromic Substring--LeetCode
- 7 - leetcode Longest Palindromic Substring
- leetcode-5. Longest Palindromic Substring
- 【LeetCode】Longest Palindromic Substring && 【九度】题目1528：最长回文子串(腾讯2013年实习生招聘二面面试题)
- [leetcode] Longest Palindromic Substring 多种解法
- leetcode Longest Palindromic Substring 005
- leetcode进阶之路——Longest Palindromic Substring
- leetcode 5. Longest Palindromic Substring
- Leetcode题解-5. Longest Palindromic Substring
- LeetCode Online Judge 题目C# 练习 - Longest Palindromic Substring
- leetcode 5 -- Longest Palindromic Substring
- leetcode之Longest Palindromic Substring
- LeetCode 5 Longest Palindromic Substring
- leetcode[5]Longest Palindromic Substring
- leetcode problem (5) Longest Palindromic Substring
- leetcode第五题--Longest Palindromic Substring