LeetCode：M-5. Longest Palindromic Substring

LeetCode链接

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

Example:

Input: "babad"

Output: "bab"

Note: "aba" is also a valid answer.

Example:

Input: "cbbd"

Output: "bb"

1、维护最长的回文长度 maxLen，检查长 maxLen 窗口添加一个新 char 后能不能形成更长的回文

2、添加一个 char，可能有3种结果

1）不构成回文，maxLen不变

2）构成回文，maxLen+1，例如 ababa，再加入b后

3）构成回文，maxLen+2，例如 ab，再加入a后

class Solution {
    public String longestPalindrome(String s) {
        int n = s.length();
        
        int maxLen=0;
        String res="";
        for(int i=0; i<n; i++){
            if(isPalindrome(s, i-maxLen-1,i)){
                res = s.substring(i-maxLen-1,i+1);
                maxLen+=2;
            }else if(isPalindrome(s, i-maxLen,i)){
                res = s.substring(i-maxLen, i+1);
                maxLen+=1;
            }    
        }        
        
        return res;
    }
    boolean isPalindrome(String str, int s, int e){
        if(s<0)
            return false;
        
        while(s<e){
            if(str.charAt(s)!=str.charAt(e))
                return false;
            s++;
            e--;
        }
        return true;
    }
}