一、题目
二、代码
class Solution
{
public int findLength(int[] nums1, int[] nums2)
{
int i,j;
int length_1;
int length_2;
length_1 = nums1.length;
length_2 = nums2.length;
int[][] dp = new int [length_1+1][length_2+1];
int result = 0;
for(i=1;i<=length_1;i++)
{
for(j=1;j<=length_2;j++)
{
if(nums1[i-1]==nums2[j-1])
{
dp[i][j] = dp[i-1][j-1]+1;
if(dp[i][j]>result) result = dp[i][j];
}
}
}
return result;
}
}