动态规划 class Solution { public: string longestPalindrome(string s) { if(s.size() < 2) return s; int start = 0, maxlen = 1, n = s.size(); vector<vector<int>> dp (n,vector<int>(n)); for(int i = 0; i < n; ++i) dp[i][i] = true; ...