5. Longest Palindromic Substring

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

Input: "babad"

Output: "bab"

Note: "aba" is also a valid answer.

Input: "cbbd"

Output: "bb"

class Solution {
public:
    string longestPalindrome(string s) {
        if(s.empty()) return "";
        if(s.size() == 1) return s;
        int k = 0, j = 0, max_len = 1, min_start = 0,new_len= 0;
        for(int i = 0; i < s.size();){
            if (s.size() - i <= max_len / 2) break; //加上这句 理论上会更快了~
            j = i; k = i;
            while(k < s.size() -1 && s[k] == s[k+1]){++k;}
            i = k + 1;   // 为了更好理解可以换成 ++i； 但是效率慢很多！
            while(k < s.size()-1 && j > 0 && s[k+1] == s[j-1]){++k; --j;}
            new_len = k - j + 1;
            if(new_len > max_len){
                min_start = j;
                max_len = new_len;
            }
        }
        return s.substr(min_start, max_len);
        
    }
};