LeetCode题目 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.

Example:

Input: "babad"

Output: "bab"

Note: "aba" is also a valid answer.

Example:

Input: "cbbd"

Output: "bb"

第一想法是暴力查找，代码如下，果然超时了。

bool is(string s){
    int l=s.size();
    for(int i=0,j=l-1;i<l/2||j>l/2;i++,j--){
        if(s[i]==s[j])continue;
        else return 0;
    }
    return true;
}
class Solution {
public:
    string longestPalindrome(string s) {
        int l=s.size();
        string t="";
        if(l==1)return s;
        for(int i=0;i<l-1;i++){
            for(int j=i;j<l;j++){
                string ss=s.substr(i,j-i+1);
                if(is(ss)){
                    if(ss.size()>t.size())t=ss;
                }
            }
        }
        return t;
    }
};

accept代码：
string longestPalindrome(string s) {
    if (s.empty()) return "";
    if (s.size() == 1) return s;
    int min_start = 0, max_len = 1;
    for (int i = 0; i < s.size();) {
      if (s.size() - i <= max_len / 2) break;
      int j = i, k = i;
      while (k < s.size()-1 && s[k+1] == s[k]) ++k; // Skip duplicate characters.
      i = k+1;
      while (k < s.size()-1 && j > 0 && s[k + 1] == s[j - 1]) { ++k; --j; } // Expand.
      int new_len = k - j + 1;
      if (new_len > max_len) { min_start = j; max_len = new_len; }
    }
    return s.substr(min_start, max_len);
}