题目
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
题意
找出两个数组中最长公共子串的长度.
分析
状态转移方程: dp[i][j]表示数组A[0:i] B[0:j]的最长公共子串的长度
由于子串是连续的,所以一旦不相等,直接赋值为0
if (A[i] == B[j])
dp[i][j] = dp[i-1][j-1] + 1;
else
dp[i][j] = 0;
代码
class Solution {
public:
int findLength(vector<int>& A, vector<int>& B) {
vector<vector<int>> dp(A.size(), vector<int>(B.size(), 0));
int res = 0;
for (int i = 0; i < A.size(); i++) {
for (int j = 0; j < B.size(); j++) {
if (A[i] == B[j])
if (i == 0 || j == 0)
dp[i][j] = 1;
else
dp[i][j] = dp[i-1][j-1] + 1;
res = max(res, dp[i][j]);
}
}
return res;
}
};
优化
还有一种状态转移dp[i][j]表示数组A[i: ] B[j: ]我认为是没有影响的,因为我都尝试过,从前往后或从后往前都可以. 只是降成一维数组的时候,循环的方式有所不同:
从前往后
class Solution {
public:
int findLength(vector<int>& A, vector<int>& B) {
vector<int> dp(B.size()+1, 0);
int res = 0;
for (int i = 0; i < A.size(); i++) {
for (int j = B.size()-1; j >= 0; j--) {
if (j == 0)
dp[j] = A[i] == B[j]? 1 : 0;
else
dp[j] = A[i] == B[j]? dp[j-1] + 1 : 0;
res = max(res, dp[j]);
}
}
return res;
}
};
从后往前,且写法更精炼
class Solution {
public:
int findLength(vector<int>& a, vector<int>& b) {
int m = a.size(), n = b.size();
if (!m || !n) return 0;
vector<int> dp(n + 1);
int res = 0;
for (int i = m - 1; i >= 0; i--) {
for (int j = 0; j < n; j++) {
res = max(res, dp[j] = a[i] == b[j] ? 1 + dp[j + 1] : 0);
}
}
return res;
}
};