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 1:

Input: “babad”
Output: “bab”
Note: “aba” is also a valid answer.
Example 2:

Input: “cbbd”
Output: “bb”

解法：
常规思路。 遍历字符串，从当前字符展开判断是否回文。时间O(n^2)，空间O(1)。

代码如下：

string longestPalindrome(string s) {
    if (s.size() <= 0)
        return "";
    if (s.size() == 1)
        return s;
    int startPos = 0, maxLen = 1;
    for (int i = 0; i < s.size(); ++i) {
        // 判断奇数情况
        int left = i - 1, right = i + 1;
        while (left >= 0 && right < s.size() && s[left]==s[right]) {
            if (right - left + 1 > maxLen) {
                maxLen = right - left + 1;
                startPos = left;
            }
            --left;
            ++right;
        }
        // 判断偶数情况 
        left = i;
        right = i + 1;
        while (left >= 0 && right < s.size() && s[left] == s[right]) {
            if (right - left + 1 > maxLen) {
                maxLen = right - left + 1;
                startPos = left;
            }
            --left;
            ++right;
        }
    }
    return s.substr(startPos, maxLen);
}

只想到这个，更优解法可参考Manacher算法