5. Longest Palindromic Substring

作者: becauseyou_90cd | 来源:发表于2018-07-27 10:00 被阅读0次

Leetcode--Longest Palindromic Su
[LeetCode] 5. Longest Palindromi
Leetcode-DP(Dynamic Programming)
[Leetcode]5. Longest Palindromic
Q5 Longest Palindromic Substring
dp java
5. Longest Palindromic Substring
Leetcode 5 - Longest Palindromic
5. Longest Palindromic Substring
[Leetcode] python 5. Longest Pal

https://leetcode.com/problems/longest-palindromic-substring/description/

代码：
class Solution {
public String longestPalindrome(String s) {

    if(s == null && s.length() == 0) return null;
    int len = s.length();
    boolean[][] dp = new boolean[len][len];
    String res="";
    for (int i = len - 1 ; i >= 0; i--){
        for(int j = i; j < len; j++){
            if(s.charAt(i) == s.charAt(j) && (j - i < 3 || dp[i+1][j-1])){
                dp[i][j] = true;
                if(j - i + 1 > res.length())
                    res = s.substring(i,j+1);
            }
        }
    }
    return res;
}

}

网友评论

本文标题：5. Longest Palindromic Substring

本文链接：https://www.haomeiwen.com/subject/pgdwmftx.html

延伸阅读

深度阅读

您也可以注册成为美文阅读网的作者，发表您的原创作品、分享您的心情！

5. Longest Palindromic Substring

相关文章

Leetcode--Longest Palindromic Su

[LeetCode] 5. Longest Palindromi

Leetcode-DP(Dynamic Programming)

[Leetcode]5. Longest Palindromic

Q5 Longest Palindromic Substring

dp java

5. Longest Palindromic Substring

Leetcode 5 - Longest Palindromic

5. Longest Palindromic Substring

[Leetcode] python 5. Longest Pal

网友评论

延伸阅读

深度阅读

栏目导航

热点阅读