【LeetCode】Longest Palindromic Substring

//一直超时啊。。。跪了
class Solution {
public:
    string longestPalindrome(string s) {
   int i, j,max_len,temp;
	int n = s.size();
	max_len = 1;
	temp=0;
	bool f[n][n];
//	vector<vector<bool>> f(n, vector<bool>(n, false));
    fill_n(&f[0][0],n*n,false);
	for (i = 0; i < n; i++)
	{
		f[i][i] = true;// dont forget;only one element can be palindromic
		for (j = 0; j<i;j++)
		{
			f[j][i] = (s[i] == s[j]) && (i - j < 2 || f[j + 1][i - 1]);
			if (f[j][i]&&(i-j+1>max_len))
			{
				
					max_len = i-j+1;
					temp = j;
	
			}
		}
	}
	return s.substr(temp, max_len);
    }
};

class Solution {
public:
    string findPal(string &s, int left, int right)
    {
        if (left < 0)
            return s.substr(left+1, 1);
            
        if (right >= s.size())
            return s.substr(right-1, 1);
            
        while(0 <= left && right < s.size())
        {
            if (s[left] != s[right])
                break;
            left--;
            right++;
        }
        
        left++;
        right--;
        
        return s.substr(left, right - left + 1);        
    }
    
    string longestPalindrome(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (s.size() == 0)
            return "";
            
        string ret;
        
        for(int i = 0; i < s.size(); i++)
        {
            string str = findPal(s, i - 1, i + 1);
            if (str.size() > ret.size())
                ret = str;
                
            str = findPal(s, i, i + 1);
            if (str.size() > ret.size())
                ret = str;
        }
        
        return ret;
    }
};