类别:dynamic programming
难度:medium
题目描述
Given two integer arrays A
and B
, return the maximum length of an subarray that appears in both arrays.
Example 1:
Input: A: [1,2,3,2,1] B: [3,2,1,4,7] Output: 3 Explanation: The repeated subarray with maximum length is [3, 2, 1].
Note:
- 1 <= len(A), len(B) <= 1000
- 0 <= A[i], B[i] < 100
算法分析
(1)i和j分别表示A和B数组的某个数字的下表,dp[i][j]表示从A的第i个数和B的第j个数相等并且到目前为止相等的子数组的长度。
(2)遍历,两层for循环,如果A[i] = B[j],则dp[i][j] = 1+dp[i - 1][j - 1]
(3)对每个dp取最大值即为最后的结果
(4)算法的时间复杂度为O(n*m)
代码实现
class Solution {
public:
int findLength(vector<int>& A, vector<int>& B) {
int n = A.size();
int m = B.size();
if (n == 0 || m == 0) return 0;
vector<vector<int> > dp(m+1, vector<int>(n+1, 0));
int result = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
// 如果前面的有相同的数字,那么会一直累加,因为i,j的坐标都同时右移一位
if (A[i - 1] == B[j - 1]) {
dp[i][j] = 1 + dp[i - 1][j - 1];
result = max(result, dp[i][j]);
}
}
}
return result;
}
};