leetcode 5. Longest Palindromic Substring

//basic one:
//time exceed limit
string record[1024][1024];
class Solution {
public:
string longestPalindrome(string s) {
string ans = “”;
string cur = “”;
int l = s.length();
int i,j;
for(i=l-1;i>=0;i–){
record[i][i] = “”;
record[i][i+1] = s[i];
if(record[i][i+1].length()>ans.length())ans = record[i][i+1];
for(j=i+2;j<=l;j++){
if(s[j-1] == s[i])
record[i][j] = s[i] + record[i+1][j-1] + s[j-1];
if(record[i][j].length()>ans.length())
ans = record[i][j];
}
}
return ans;
}
};