[LeetCode] Longest Palindromic Substring 解题报告
来源：互联网 发布：淘宝创业成功故事 编辑：程序博客网 时间：2024/05/17 04:37
REF: http://fisherlei.blogspot.com/2012/12/leetcode-longest-palindromic-substring.html
DP solution
定义函数P[i,j] = 字符串区间[i,j]是否为palindrome.
首先找个例子，比如S="abccb",
S= a b c c b
Index = 0 1 2 3 4
P[0,0] =1 //each char is a palindrome
P[0,1] =S[0] == S[1] , P[1,1] =1
P[0,2] = S[0] == S[2] && P[1,1], P[1,2] = S[1] == S[2] , P[2,2] = 1
P[0,3] = S[0] == S[3] && P[1,2], P[1,3] = S[1] == S[3] && P[2,2] , P[2,3] =S[2] ==S[3], P[3,3]=1
......................
由此就可以推导出规律
P[i,j] = 1 if i ==j
= S[i] ==S[j] if j = i+1
= S[i] == S[j] && P[i+1][j-1] if j>i+1
代码如下所示：
<div></div>
0 0
- [LeetCode] Longest Palindromic Substring 解题报告
- 【LeetCode】Longest Palindromic Substring 解题报告
- [LeetCode] Longest Palindromic Substring 解题报告
- LeetCode解题报告--Longest Palindromic Substring
- [leetcode] 5. Longest Palindromic Substring 解题报告
- [LeetCode] Longest Palindromic Substring 解题报告
- Longest Palindromic Substring [Leetcode 解题报告]
- 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 解题报告]005.Longest Palindromic Substring
- LeetCode(5) Longest Palindromic Substring解题报告
- Leetcode Longest Palindromic Substring解题报告
- 【Leetcode】5.Longest Palindromic Substring 解题
- [Leetcode]解题文档-Longest Palindromic Substring
- leetcode解题方案--005--Longest Palindromic Substring
- Android调整TimePicker和DatePicker大小
- 解决长按手势两次触发事件的问题
- 用VMware 安装Ubuntu详细过程（图解）
- sqlldr简单导入自增序列的数据
- opencv 安装的问题
- [LeetCode] Longest Palindromic Substring 解题报告
- hdoj 4960 DP
- jquery.form 上传文件，且完成后页面不跳转
- iOS开发之Objective-C与JavaScript的交互
- EPON原理及关键技术
- socket 组播接收和发送实例
- 39个让你受益的HTML5教程
- DexFile_openDexFileNative函数解析
- Objective-C 单例、用户首选项(UserDefaults)、对象归档
