LeetCode718. Maximum Length of Repeated Subarray
来源:互联网 发布:试发型的软件 编辑:程序博客网 时间:2024/05/20 22:41
LeetCode718. 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: 3Explanation: The repeated subarray with maximum length is [3, 2, 1].
Note:
- 1 <= len(A), len(B) <= 1000
- 0 <= A[i], B[i] < 100
题目分析:比较典型的动态规划题,和字符串相同的题有点类似。
主要思想:
max1 = max(max1, dp[j] = A[i-1] == B[j-1]?dp[j-1]+1:0);
代码:
class Solution {public: int findLength(vector<int>& A, vector<int>& B) { int max1 = 0; vector<int> dp(B.size()+1); for (int i = 1; i <= A.size(); i++) { for (int j = B.size(); j > 0; j--){ max1 = max(max1, dp[j] = A[i-1] == B[j-1]?dp[j-1]+1:0); } } return max1; }};
阅读全文
0 0
- LeetCode718. Maximum Length of Repeated Subarray(Medium)
- LeetCode718. Maximum Length of Repeated Subarray
- Maximum Length of Repeated Subarray
- Maximum Length of Repeated Subarray
- Maximum Length of Repeated Subarray
- leetcode 718( Maximum Length of Repeated Subarray)
- Leetcode 718. Maximum Length of Repeated Subarray
- 718. Maximum Length of Repeated Subarray
- 718. Maximum Length of Repeated Subarray
- 718. Maximum Length of Repeated Subarray
- Leetcode | Maximum Length of Repeated Subarray
- LeetCode #718 Maximum Length of Repeated Subarray
- Maximum Length of Repeated Subarray解题报告
- 718.Maximum Length of Repeated Subarray(M)
- Leetcode | Maximum Length of Repeated Subarray
- LeetCode:Maximum Length of Repeated Subarray
- [leetcode]Maximum Length of Repeated Subarray
- 718. Maximum Length of Repeated Subarray
- 组合游戏
- SG函数模板
- hbase的region分区
- LeetCode646. Maximum Length of Pair Chain
- LeetCode·64. Minimum Path Sum
- LeetCode718. Maximum Length of Repeated Subarray
- Linux下安装、启动PHP
- 34岁!100天!学会Java编程(Day20-Day28)—Web前端编程
- C#动态生成html数据并发送到本地剪贴板
- Git实用指令
- 2017/11/25 C语言总结
- JAVA——GC
- 2017/11/25 C语言作业
- day 30 awk复习