Longest Palindromic Subsequence LeetCode solution in C++

1
class Solution {
2
 public:
3
  int longestPalindromeSubseq(string s) {
4
    int n = s.size();
5
    int dp[n][n];
6
    memset(dp, 0, sizeof(dp));
7
    for (int i = 0; i < n; i++) {
8
      dp[i][i] = 1;
9
    }
10
    int res = 1;
11
    for (int j = 1; j < n; j++) {
12
      for (int r = 0, c = j; r < n && c < n; r++, c++) {
13
        if (s[r] == s[c]) {
14
          dp[r][c] = 2 + dp[r + 1][c - 1];
15
        } else {
16
          dp[r][c] = max(dp[r][c - 1], dp[r + 1][c]);
17
        }
18
      }
19
    }
20
    return dp[0][n - 1];
21
  }
22
};