【Leetcode】No.5 Longest Palindromic Substring

一、暴力法

时间复杂度、空间复杂度 均为O(n^2)

 public String longestPalindrome(String s) {
        //暴力算法
        if(s.isEmpty()){
            return s;
        }
        String res = s.substring(0,1);
        for (int i =0; i<s.length();i++){
            for (int j=i+1;j<=s.length();j++){ //此处==是因为子串只取到前一位
                String os = s.substring(i,j); //子串正序
                String rs = new StringBuffer(os).reverse().toString(); //子串逆序
                if (os.equals(rs) && os.length()>res.length()){
                    res = os;
                }
            }
        }
        return res;
    }

 

 

 

二、动态规划

时间复杂度、空间复杂度 均为O(n^2)

public String longestPalindrome_1(String s) {
       //三种情况：is[i][j]表示(i,j)之间的字符串是否为回文串
        // 1. i==j ,则is[i][j] = true
        // 2. i+1 == j, 则is[i][j] 取决于 s[i] == s[j] ab或bb
        // 3. i+1 < j，则is[i][j] 取决于 is[i+1][j-1] && s[i] == s[j]
        int len  = s.length();
        if (len <=1) return  s;
        int st = 0, end = 0;
        char[] chars = s.toCharArray();
        boolean[][] is = new boolean[len][len];
        for(int j=0; j<len; j++){
            is[j][j] = true;  //i=j
            for (int i=0; i<j; i++){
                if(i+1 == j){
                    is[i][j] = chars[i]==chars[j];
                }else {
                    is[i][j] = is[i+1][j-1] && chars[i] == chars[j];
                }
                //更新子串起始点
                if(is[i][j] && j - i > end - st){
                    end = j;
                    st = i;
                }
            }
        }
        return s.substring(st, end+1);

    }