5. Longest Palindromic Substring

public class Solution {
    int min=0,max=0;
    public String longestPalindrome(String s) {
        if(s.length()<2) return s;
        for(int i=0;i=0&&j

你可能感兴趣的:(5. Longest Palindromic Substring)