5. Longest Palindromic Substring

作者: 夜皇雪 | 来源:发表于2016-12-13 06:42 被阅读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

public class Solution {
    int min=0,max=0;
    public String longestPalindrome(String s) {
        if(s.length()<2) return s;
        for(int i=0;i<s.length();i++){
            helper(s,i,i);
            helper(s,i,i+1);
        }
        return s.substring(min,max+1);
    }
    public void helper(String s,int i,int j){
        while(i>=0&&j<s.length()&&(s.charAt(i)==s.charAt(j))){
            i--;j++;
        }
        if(max-min<j-i-1){
            min=i+1;
            max=j-1;
        }
    }
}

网友评论

本文标题：5. Longest Palindromic Substring

本文链接：https://www.haomeiwen.com/subject/jzuvmttx.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

网友评论

延伸阅读

深度阅读

栏目导航

热点阅读