Skip to content

Commit 8c26d9d

Browse files
authored
day25
1 parent af8c5ea commit 8c26d9d

File tree

1 file changed

+17
-0
lines changed

1 file changed

+17
-0
lines changed

Day25-UncrossedLines.java

+17
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
class Solution {
2+
public int maxUncrossedLines(int[] A, int[] B) {
3+
int matrix[][] = new int[A.length+1][B.length+1];
4+
5+
for (int i=1; i<=A.length; i++)
6+
{
7+
for (int j=1; j<=B.length; j++)
8+
{
9+
if (A[i-1] == B[j-1])
10+
matrix[i][j] = matrix[i-1][j-1] + 1;
11+
else
12+
matrix[i][j] = Math.max(matrix[i-1][j], matrix[i][j-1]);
13+
}
14+
}
15+
return matrix[A.length][B.length];
16+
}
17+
}

0 commit comments

Comments
 (0)