[leetcode] 5. Longest Palindromic Substring

Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofS is 1000, and there exists one unique longest palindromic substring.

这道题是找出字符串的最长回文子串，题目难度为Medium。

针对字符串中的每一个字符，查看以该字符为中心的最长回文子串长度，记录下最长的就可以了。这里需要注意回文子串长度有奇数和偶数两种情况。具体代码：

class Solution {
    void checkPal(const string& s, int m, int n, int& pos, int& len) {
        while((m>=0) && (n<s.size()) && (s[m]==s[n])) {
            m--;
            n++;
        }
        if(n-m-1 > len) {
            len = n-m-1;
            pos = m+1;
        }
    }
public:
    string longestPalindrome(string s) {
        if(s.length() <= 1) return s;
        
        int len = 0, pos = 0;
        
        for(int i=0; i<s.length()-1; i++) {
            checkPal(s, i, i, pos, len);
            checkPal(s, i, i+1, pos, len);
        }
        
        return s.substr(pos, len);
    }
};