首页 > 代码库 > Longest Palindromic Substring[leetcode]
Longest Palindromic Substring[leetcode]
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.
class Solution {public: string longestPalindrome(string s) { int len = s.length(); string ans = ""; for(int i=0;i<len;i++){ int ind = min(i, len-i-1), j=1; for(j=1;j<=ind;j++){ if(s[i-j] != s[i+j]){ break; } } string tmp = s.substr(i-j+1, 2*j-1); if(tmp.length() > ans.length()) ans = tmp; }
// assume the length is odd for(int i=0;i<len-1;i++){ if(s[i]==s[i+1]){ int ind = min(i, len-i-2), j=1; for(j=1;j<=ind;j++){ if(s[i-j] != s[i+1+j]){ break; } } string tmp = s.substr(i-j+1, 2*j); if(tmp.length() > ans.length()) ans = tmp; } }
//assume the length is even return ans; }};
Longest Palindromic Substring[leetcode]
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。