【LeetCode】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.

判定一个字符串是否为回文，只需要判定s[i+k]==s[i-k]就好了，其中i为中心字符，因此以s的第一个字符作为中心字符，遍历至最后一个，对每个i分别讨论奇偶情况。

代码如下:

class Solution {
public:
	string longestPalindrome(string s) {
		string res;
		int len(0);
		int N = s.length();
		for (int i = 0; i < N;i++)
		for (int j = 0; j < 2;j++)
		for (int k = 0; k <= min(i, N - i - 1); k++){
			if (i - k - j >= 0 && s[i - k - j] == s[i + k]){
				int currlen = (k + 1) * 2 - 1 + j;
				if (currlen>len){
					len = currlen;
					res = s.substr(i - k - j, currlen);
				}
			}
			else
				break;
		}
		return res;
	}
};