leetcode Longest Palindromic Substring

优秀的解法：http://www.cnblogs.com/xubenben/p/3330746.html

代码：（Time Limit  Exceeded），这博客已经被我写成我的刷题实况了。接下来还有新的写法。

#include<iostream>
#include<string>

using namespace std;

string longestPalindrome(string s)
{
    int n = s.length();
    int max = n;
    if (n == 1)
        return s;
    while (max != 1)
    {
        int i = n - max;
        int j = 0;
        while (j <= i)
        {
            int t = j;
            int middle = max / 2 + j - 1;
            for (; t <= middle; t++)
            {
                if (max % 2 == 1)
                {
                    if (s[t] != s[middle * 2 + 2 - t])
                    {
                        break;
                    }
                }
                else
                {
                    if (s[t] != s[middle * 2 - t + 1])
                    {
                        break;
                    }
                }
            }
            if (t == middle + 1)
            {
                return s.substr(j, j+max);
            }
            else
            {
                j++;
            }
        }
        max--;
    }
}

int main()
{
    string s = "a";
    cout << s << endl;
    cout << longestPalindrome(s) << endl;
}