【C++】【LeetCode】5. Longest Palindromic Substring
来源:互联网 发布:捕鱼软件下载 编辑:程序博客网 时间:2024/06/05 23:39
链接:Longest Palindromic Substring
思路:从字符串左边开始遍历,每个i假设为回文的最中心,略过重复字符,然后向左右两边比较字符是否相同,
直到碰到不相同的,记录长度,如果长度大于最大回文长度,替换,否则放弃。
代码:
class Solution {
public:
string longestPalindrome(string s) {
if (s.size() <= 1){
return s;
}
int begin = 0;
int maxLen = 1;
for (int i=0; i<s.size() && (s.size()-i)*2>= maxLen;){
int left=i, right = i;
//跳过重复的元素
while (right < s.size()-1 && s[right] == s[right+1]){ right ++; }
i = right+1; //右边非重复的第一个
while (left>0 && right<s.size() && s[left-1]==s[right+1]){
left --;
right ++;
}
if (maxLen<(right-left+1)){
maxLen = right-left+1;
begin = left;
}
}
return s.substr(begin, maxLen);
}
};
public:
string longestPalindrome(string s) {
if (s.size() <= 1){
return s;
}
int begin = 0;
int maxLen = 1;
for (int i=0; i<s.size() && (s.size()-i)*2>= maxLen;){
int left=i, right = i;
//跳过重复的元素
while (right < s.size()-1 && s[right] == s[right+1]){ right ++; }
i = right+1; //右边非重复的第一个
while (left>0 && right<s.size() && s[left-1]==s[right+1]){
left --;
right ++;
}
if (maxLen<(right-left+1)){
maxLen = right-left+1;
begin = left;
}
}
return s.substr(begin, maxLen);
}
};
0 0
- LeetCode 5. Longest Palindromic Substring(C++)
- 【C++】【LeetCode】5. Longest Palindromic Substring
- leetcode Longest Palindromic Substring(C)
- LeetCode 5. Longest Palindromic Substring
- LeetCode --- 5. Longest Palindromic Substring
- LeetCode 5.Longest Palindromic Substring
- [Leetcode] 5. Longest Palindromic Substring
- [LeetCode]5.Longest Palindromic Substring
- [leetcode] 5. Longest Palindromic Substring
- LeetCode-5. Longest Palindromic Substring
- leetcode 5. Longest Palindromic Substring
- leetcode 5. Longest Palindromic Substring
- Leetcode 5. Longest Palindromic Substring
- LeetCode 5. Longest Palindromic Substring
- Leetcode 5. Longest Palindromic Substring
- leetcode 5. Longest Palindromic Substring
- LeetCode-5. Longest Palindromic Substring
- Leetcode 5. Longest Palindromic Substring
- SpringMVC面试题
- Accessing Device Files From Kernel Space Code
- Map 如何循环输出
- http常见状态码
- 知识海洋
- 【C++】【LeetCode】5. Longest Palindromic Substring
- 浅理解接口回调
- PAT_1011. World Cup Betting
- 从影片《点球成金》看大数据如何创造商业奇迹!
- 将elasticsearch设置为windows系统服务
- 打开vmware的centos虚拟机提示锁定文件失败 打不开磁盘
- LeetCode算法题目:Partition List
- LeetCode: Pascal's Triangle II
- win7 64 + xbmc-17.1rc1-Krypton + vs2015编译