摘要：1 string longestPalinderome(string s) { 2 int N = s.size(); 3 int id = 0, mx = 0; 4 vector dp(2 * N + 1); 5 for (int i = 0; i i) { 8 dp[i] = min(mx - i, dp[j]); 9 }10 int left = i - dp[i], right = i + dp[i];11 for (; left >= 0 && right mx) {19 ... 阅读全文