[LeetCode]—Longest Palindromic Substring 最长回文子串
来源:互联网 发布:交换机网络克隆的意思 编辑:程序博客网 时间:2024/05/18 14:27
Longest Palindromic Substring
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.
分析:
最长回文子串,解法有几种,主要还是考察动态规划。
设f(i,j),表示区间[i,j]是否回文,回文则为1,否则为0。f(i,j)的关系表示如下:
代码:
class Solution{public: string longestPalindrome(string s){ int len=s.length(); int f[len][len]; memset(f,0,len*len*sizeof(int)); int maxL=1,start=0; for(int i=0;i<len;i++){ f[i][i]=1; for(int j=0;j<i;j++){ // j<i f[j][i]=(s[j]==s[i] && (j+1==i || f[j+1][i-1])); if(f[j][i] && maxL<(i-j+1)){ maxL=i-j+1; start=j; } } } return s.substr(start,maxL); }};
0 0
- [LeetCode]—Longest Palindromic Substring 最长回文子串
- [LeetCode] Longest Palindromic Substring 最长回文子串
- LeetCode Longest Palindromic Substring(最长回文子串)
- LeetCode | Longest Palindromic Substring(最长回文子串)
- Longest Palindromic Substring [LeetCode] 最长回文子串
- LeetCode OJ 之 Longest Palindromic Substring (最长回文子串)
- [C++]LeetCode: 99 Longest Palindromic Substring (最长回文子串)
- LeetCode Longest Palindromic Substring 最长回文子串
- LeetCode-5 Longest Palindromic Substring(求最长回文子串)
- LeetCode:Longest Palindromic Substring 最长回文子串
- 最长回文子串(LeetCode #5 Longest Palindromic Substring)
- 【LeetCode】5.Longest Palindromic Substring 最长回文子串问题
- LeetCode 5. Longest Palindromic Substring(最长回文子串)
- 转载:LeetCode:5Longest Palindromic Substring 最长回文子串
- leetcode--Longest Palindromic Substring--最长回文子串--
- LeetCode:Longest Palindromic Substring 最长回文子串
- [Leetcode #5]Longest Palindromic Substring 寻找最长回文子串
- LeetCode---5. Longest Palindromic Substring(最长回文子串)
- CC++初学者编程教程(7) 搭建Windows EclipseCCPP软件开发环境
- 无限级展开树经验。
- HDU 4005 The war
- IOS8 APP Extension(app扩展) 1
- SharePoint对于Workflow的历史信息清理的要点
- [LeetCode]—Longest Palindromic Substring 最长回文子串
- OCP 1Z0 053 55
- c++ 中__declspec 的用法
- 安卓开发工具优化APK,让软件更流畅
- stm32 IO 分类
- PLSQL Developer建表时注释(COMMENT)中文乱码的解决方案(Windows)
- 触摸屏中禁用右键的方法
- 常用的
- POJ 2393-Yogurt factory 贪心算法