Longest Palindromic Substring
来源:互联网 发布:三菱plc编程入门 编辑:程序博客网 时间:2024/05/01 15:02
I: 二维DP
外层循环是子串长度,内层循环是子串起始位置,同时更新最长的长度和起始位置,用于返回时调用substr
class Solution {public: string longestPalindrome(string s) { if (s.size()==0) return NULL; int len=1, start=0; int n=s.size(); bool t[n][n]; for (int i=0; i<n; i++) { t[i][i] = true; } for (int l=2; l<=n; l++) // outer loop for substring length { for (int i=0; i<=n-l; i++) { // inner loop for the start of the substring int j=i+l-1; t[i][j]=false; if ((j-i>1 && t[i+1][j-1] && s[i]==s[j]) || (j-i==1 && s[i]==s[j])) { t[i][j]=true; if (l>len) { len=l; start=i; } } } } return s.substr(start,len); }};
0 0
- LeetCode: Longest Palindromic Substring
- LeetCode Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- [Leetcode] Longest Palindromic Substring
- Longest Palindromic substring
- [LeetCode] Longest Palindromic Substring
- LeetCode5:Longest Palindromic Substring
- Leetcode : Longest Palindromic Substring
- Longest Palindromic Substring
- Longest Palindromic Substring
- [LeetCode]Longest Palindromic Substring
- leetcode Longest Palindromic Substring
- Longest Palindromic Substring
- LeetCode-Longest Palindromic Substring
- Longest Palindromic Substring
- Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Longest Palindromic Substring leetcode
- wince 6.0 BSP 移植问题
- 今起可购除夕火车票 12306网站或迎“最强考验”
- 一切成功源于积累——20140106-20140110周 复盘(4) 黄金
- 滤波与锐化
- 深入理解计算机系统笔记
- Longest Palindromic Substring
- 国际著名黑客大赛介绍与比较
- SVN部署环境文件
- 9条经典的编程语录
- ASP.NET判断页面加载所耗时间
- javascript面向对象编程(四)
- WinCE之TCP编程——服务器端
- [转帖]一个华为哥们学习&开发GSM的一些事
- 用3个步骤实现响应式网页设计