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"
class Solution {
public:
string longestPalindrome(string s)
{
int n=s.size();
if(n==0)
return "";
string lon=s.substr(0,1);
for(int i=0;i<n-1;i++)
{
string s1=expand(s,i,i);
if(lon.size()<s1.size())
lon=s1;
string s2=expand(s,i,i+1);<