最长回文字串的提取（相当精简！）

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.

class Solution {
public:
	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;
		  i = k+1;//i 是 遍历下标
		  while (k < s.size()-1 && j > 0 && s[k+1] == s[j-1])//回文扩展比对
		  {
			  ++k;
			  --j;
		  }
		  
		  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);
    }