[leetcode] Longest Palindromic Substring *
摘要：
1 /* 2 * DP 3 * 4 * d[i][j] represents the length of longest Palindromic 5 * substring of s[i...j]. 6 * 7 * |- j-i+1 (s[i] == s[j] && s[i+1...j-1] is Palindrome) 8 * d[i][j] = | 9 * |- max{ d[i+1][j], d[i][j-1] }10 *11 * Note: use circular array.12 */13 14 #incl... 阅读全文
posted @ 2013-03-08 23:31 龙豆 阅读(282) 评论(0) 推荐(0)
浙公网安备 33010602011771号