def longestPalindrome(s: str) -> str: n = len(s) if n < 2: return s dp = [[False for _ in range(n)] for _ in range(n)] max_len = 1 start = 0 for i in range(n): dp[i][i] = True for j in range(1, n): for i in range(j): if s[i] == s[j]: if j - i < 3: dp[i][j] = True else: dp[i][j] = dp[i+1][j-1] else: dp[i][j] = False if dp[i][j]: cur_len = j - i + 1 if cur_len > max_len: max_len = cur_len start = i return s[start:start+max_len] 翻译成c++

好的，以下是该 Python 代码的 C++ 版本：

#include <string>
#include <vector>
using namespace std;

class Solution {
public:
    string longestPalindrome(string s) {
        int n = s.size();
        if (n < 2) {
            return s;
        }
        vector<vector<bool>> dp(n, vector<bool>(n, false));
        int max_len = 1, start = 0;
        for (int i = 0; i < n; ++i) {
            dp[i][i] = true;
        }
        for (int j = 1; j < n; ++j) {
            for (int i = 0; i < j; ++i) {
                if (s[i] == s[j]) {
                    if (j - i < 3) {
                        dp[i][j] = true;
                    } else {
                        dp[i][j] = dp[i+1][j-1];
                    }
                } else {
                    dp[i][j] = false;
                }
                if (dp[i][j]) {
                    int cur_len = j - i + 1;
                    if (cur_len > max_len) {
                        max_len = cur_len;
                        start = i;
                    }
                }
            }
        }
        return s.substr(start, max_len);
    }
};

希望能够帮助到您！