Longest Common Subsequence LeetCode solution in C++

1
class Solution {
2
 public:
3
  int longestCommonSubsequence(string text1, string text2) {
4
    int dp[1001][1001] = {0};
5
    for (int i = 1; i <= text1.size(); i++)
6
      for (int j = 1; j <= text2.size(); j++)
7
        if (text1[i - 1] == text2[j - 1])
8
          dp[i][j] = 1 + dp[i - 1][j - 1];
9
        else
10
          dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
11
    return dp[text1.size()][text2.size()];
12
  }
13
};