5. Longest Palindromic Substring(java)

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Example 1:

Input: "babad"
Output: "bab"
Note: "aba" is also a valid answer.

Example 2:

Input: "cbbd"
Output: "bb"

思路：从每个点开始做奇，偶扩展，当扩展的长度最大时，记录left，right的index值，我的写法不是最优，因为我每次扩展返回的是string，然而实际上返回index即可。

class Solution {
    public String longestPalindrome(String s) {
        if (s.length() == 0) return s;
        String res = s.substring(0,1);
        char[] ss = s.toCharArray();
        for (int i = 0; i < s.length() - 1; i++) {
            String s1 = helper(ss, i, i+1);
            if (s1.length() > res.length()) res = s1;
            String s2 = helper(ss, i-1, i+1);
            if (s2.length() > res.length()) res = s2;
        }
        return res;
    }
    public String helper(char[] s, int l, int r) {
        while (l >= 0 && r < s.length && s[l] == s[r]) {
            l--;
            r++;
        }
        String res = new String(s);
        if (l < 0 || r >= s.length || s[l] != s[r]) return res.substring(l+1, r);
        return res.substring(l,r+1) ;
    }
}

这是更优的解法。

class Solution {
    public String longestPalindrome(String s) {
    if (s == null || s.length() < 1) return "";
    int start = 0, end = 0;
    for (int i = 0; i < s.length(); i++) {
        int len1 = expandAroundCenter(s, i, i);
        int len2 = expandAroundCenter(s, i, i + 1);
        int len = Math.max(len1, len2);
        if (len > end - start) {
            start = i - (len - 1) / 2;
            end = i + len / 2;
        }
    }
    return s.substring(start, end + 1);
}

private int expandAroundCenter(String s, int left, int right) {
    int L = left, R = right;
    while (L >= 0 && R < s.length() && s.charAt(L) == s.charAt(R)) {
        L--;
        R++;
    }
    return R - L - 1;
}
}