class Solution {
public:
int findLength(vector<int>& A, vector<int>& B) {
int res = 0;
if (A.size() == 0 || B.size() == 0) return 0;
vector<vector<int>> dp(A.size(), vector<int>(B.size(),0));
for (int i = 0; i < B.size(); ++i) {
if (A[0] == B[i]) {
dp[0][i] = 1;
res = 1;
}
}
for (int i = 1; i < A.size(); ++i) {
if (A[i] == B[0]) {
dp[i][0] = 1;
res = max(res, 1);
}
for (int j = 1; j < B.size(); ++j) {
if (A[i] == B[j]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
res = max(res, dp[i][j]);
}
}
}
return res;
}
};
