LeetCode Longest Palindromic Substring(最长回文子串)
2014-04-29 19:20
639 查看
public class Solution { public String longestPalindrome(String s) { int len = s.length(); if (len <= 1) return s; boolean[][] table = new boolean[len][len]; for (int i = 0; i < len; i++) { table[i][i] = true; } String longestStr = null; int maxLen = 0; for (int i = 0; i < len - 1; i++) { if (s.charAt(i) == s.charAt(i + 1)) { table[i][i + 1] = true; longestStr = s.substring(i, i + 2); } } for (int l = 3; l <= len; l++) { for (int i = 0; i <= len - l; i++) { int j = i + l - 1; if (s.charAt(i) == s.charAt(j)) { table[i][j] = table[i + 1][j - 1]; if (table[i][j] && l > maxLen) { maxLen = l; longestStr = s.substring(i, j + 1); } } else { table[i][j] = false; } } } return longestStr; } }
相关文章推荐
- LeetCode_5---Longest Palindromic Substring (求最长回文子串)
- LeetCode-5-Longest Palindromic Substring 最长回文子串DP
- LeetCode OJ-5.Longest Palindromic Substring(最长回文子串)
- 【LeetCode刷题】最长回文子串Longest Palindromic Substring(java)
- LeetCode题库解答与分析——#5.最长回文子串LongestPalindromicSubstring
- leetcode--Longest Palindromic Substring--最长回文子串--
- LeetCode 5 Longest Palindromic Substring(最长回文子串,暴力剪枝/DP/曼彻斯特算法)
- LeetCode 5. Longest Palindromic Substring(最长回文子串)
- [LeetCode] Longest Palindromic Substring 最长回文子串
- 【LeetCode】Longest Palindromic Substring && 【九度】题目1528:最长回文子串(腾讯2013年实习生招聘二面面试题)
- [LeetCode]—Longest Palindromic Substring 最长回文子串
- LeetCodeOJ_5_m_Longest Palindromic Substring(最长回文子串)
- 【LeetCode-面试算法经典-Java实现】【005-Longest Palindromic Substring(最长回文子串)】
- leetcode(5)—— Longest Palindromic Substring(最长回文子串)
- 最长回文子串-LeetCode 5 Longest Palindromic Substring
- leetcode5-Longest Palindromic Substring(最长回文子串)
- LeetCode:Longest Palindromic Substring 最长回文子串
- LeetCode | Longest Palindromic Substring(最长回文子串)
- leetcode-5. Longest Palindromic Substring(寻找最长回文子串)
- LeetCode---5. Longest Palindromic Substring(最长回文子串)