[LeetCode] Longest Palindromic Substring
来源:互联网 发布:软件项目生命周期图 编辑:程序博客网 时间:2024/05/01 16:54
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.
思路:两种思路 ,一种是常规思路,从每个位置向两遍扩展,找到最长回文字串,不过要注意区分偶数和奇数的中心位置。
第二种思路是动态规划, dp[i][j] = dp[i + 1][j - 1] && s[i] == s[j],且 i >= j 为true
public class Solution { public String longestPalindrome(String s) { if (s == null || s.length() < 1) { return null; } String res = ""; for (int i = 0; i < 2 * s.length() - 1; i++) { int left = i / 2; int right = i / 2; if (i % 2 == 1) { right++; } String str = getMaxPalindromicString(s, left, right); if (str.length() > res.length()) { res = str; } } return res; } private String getMaxPalindromicString(String s, int left, int right) { while (left >= 0 && right < s.length() && s.charAt(left) == s.charAt(right)) { left--; right++; } return s.substring(left + 1, right); }}
0 0
- LeetCode: Longest Palindromic Substring
- LeetCode Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- [Leetcode] Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Leetcode : Longest Palindromic Substring
- [LeetCode]Longest Palindromic Substring
- leetcode Longest Palindromic Substring
- LeetCode-Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Longest Palindromic Substring leetcode
- LeetCode Longest Palindromic Substring
- LeetCode - Longest Palindromic Substring
- LeetCode -- Longest Palindromic Substring
- LeetCode | Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- [LeetCode]Longest Palindromic Substring
- leetcode Longest Palindromic Substring
- ctags配置后不能使用,报错E432:Tags file not sorted
- Codeforces Round #263 (Div. 2) A-D
- 悼念512汶川大地震遇难同胞――珍惜现在,感恩生活(背包九讲_多重背包)
- 【其他】ROM 和 RAM
- IntelliJ IDEA 控制台中文乱码问题
- [LeetCode] Longest Palindromic Substring
- 代码大全2-作用域-使变量引用局部化
- 支持向量机通俗导论(理解SVM的三层境界)
- BFS(广度优先搜索) 和 DFS(深度优先搜索)
- 代码中加入如下内容,可保上线平安无事!~!~!~!~~~!~!!~
- 单目运算符重载
- linux常见面试题答案
- PHP 类
- zoj 1456 Minimum Transport Cost (Floyd+路径记录)