leetcode

0 class Solution {

1 public:

2 int minInsertions(string s) {

3 int dp[501][501] = {0}, n = s.size();

4 for (int i = 0; i < n; i++)

5 for (int j = 0; j < n; j++)

6 if (s[i] == s[n - 1 - j])

7 dp[i + 1][j + 1] = dp[i][j] + 1;

8 else

9 dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);

10 return n - dp[n][n];

11 }

12 };