[LeetCode]Maximum Length of Repeated Subarray
2017-11-23 20:19
375 查看
Maximum Length of Repeated Subarray:
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
这是一道典型的动态规划题目。
寻找子序列的规律如下:
![](https://img-blog.csdn.net/20171123201817165?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvZm9uZ182MTM=/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/SouthEast)
具体思想可见动态规划解最长公共子序列问题。
而这是一道找公共子串的题目,和上面不同的是,当xi != yi时,c[i,j]=0。
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
这是一道典型的动态规划题目。
寻找子序列的规律如下:
具体思想可见动态规划解最长公共子序列问题。
而这是一道找公共子串的题目,和上面不同的是,当xi != yi时,c[i,j]=0。
class Solution { public: int findLength(vector<int>& A, vector<int>& B) { int temp[1001][1001],max = 0; for(int i = 0; i < A.size(); i++){ for(int j = 0; j < B.size(); j++){ if(A[i] == B[j]){ temp[i+1][j+1] = temp[i][j] + 1; }else{ temp[i+1][j+1] = 0; } max = max>temp[i+1][j+1]?max:temp[i+1][j+1]; } } return max; } };
相关文章推荐
- LeetCode-718:Maximum Length of Repeated Subarray (最长公共子数组) -- medium
- leetcode练习 Maximum Length of Repeated Subarray
- LeetCode:Maximum Length of Repeated Subarray
- Leetcode | Maximum Length of Repeated Subarray
- [LeetCode] Maximum Length of Repeated Subarray 最长的重复子数组
- Leetcode 718 Maximum Length of Repeated Subarray
- leetcode010-Maximum Length of Repeated Subarray(LCS动态规划)
- LeetCode 718 Maximum Length of Repeated Subarray
- Leetcode | Maximum Length of Repeated Subarray
- [leetcode]Maximum Length of Repeated Subarray
- leetcode: Maximum Length of Repeated Subarray
- LeetCode:Maximum Length of Repeated Subarray
- Maximum Length of Repeated Subarray
- HashTable-718-Maximum Length of Repeated Subarray
- LeetCode#718 Maximum Length of Repeated Subarray (week9)
- LeetCode #718 Maximum Length of Repeated Subarray
- Maximum Length of Repeated Subarray
- LeetCode.718 Maximum Length of Repeated Subarray(经典DP问题)
- 【C++】动态规划方法以及Maximum Length of Repeated Subarray
- [LeetCode] DP 之 Maximum Length of Repeated Substring