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, and there exists one unique longest palindromic substring.

Have you been asked this question in an interview? 


最长回文子串问题，这里题目给的字符串长度不算长，算法使用中心扩展的方法时间复杂度为O(n^2)就可以接受。当然还有时间复杂度为O(n)的算法。

class Solution {
public:
	string longestPalindrome(string s) {
		string res;
		for (int i = 0; i < s.length(); ++i)
		{
			string res1 = expandFromCenter(s, i, i);
			string res2 = expandFromCenter(s, i, i + 1);
			res1 = res1.length() > res2.length() ? res1 : res2;
			res = res.length() > res1.length() ? res : res1;			
		}
		return res;
	}

	string expandFromCenter(string s, int centerL, int centerR)
	{
		int len = s.length(), left = centerL, right = centerR;
		while (left >= 0 && right <= len - 1 && s[left] == s[right])
		{ 
			--left;
			++right; 
		}
		return s.substr(left + 1, right - left - 1);
	}
};