class Solution {
public:
int findLength(vector<int>& A, vector<int>& B) {
int n = A.size();
int m = B.size();
vector<vector<int>> dp(n + 1, vector<int>(m + 1, 0));
dp[0][0] = 0;
int ans = -0x3f3f3f3f;
for (int i = 1;i <= n;i ++) {
for (int j = 1;j <= m;j ++) {
if (A[i - 1] == B[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
}
else {
dp[i][j] = 0; // <-here
dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
}
ans = max(ans, dp[i][j]);
}
}
return ans;
}
};
最长公共子序列和子串
最新推荐文章于 2022-07-12 15:54:40 发布