Let's test your knowledge. Fill in the missing part by typing it in.
In the longest common subsequence problem, we can use dynamic programming to calculate the ___ of the longest common subsequence between two strings.
The ___ method is defined as follows:
TEXT/X-JAVA
1int longestCommonSubsequence(String str1, String str2) {
2 int m = str1.length();
3 int n = str2.length();
4 int[][] dp = new int[m + 1][n + 1];
5
6 for (int i = 1; i <= m; i++) {
7 for (int j = 1; j <= n; j++) {
8 if (str1.charAt(i - 1) == str2.charAt(j - 1)) {
9 dp[i][j] = dp[i - 1][j - 1] + 1;
10 } else {
11 dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
12 }
13 }
14 }
15
16 return dp[m][n];
17}Write the missing line below.
