LeetCode718. Maximum Length of Repeated Subarray(Medium)
来源:互联网 发布:网络羽绒服品牌排行榜 编辑:程序博客网 时间:2024/06/05 02:38
原题:https://leetcode.com/problems/maximum-length-of-repeated-subarray/description/
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:
1 2 3 5 4 5 4 1 4 2
位置2:
1 2 3 5 4 5 4 1 4 2
在当前我位置中寻找匹配的最大子串,然后再和其他位置 的情况对比,选出所有情况的最大子串。
class Solution {public: int cnt(vector<int>& A, vector<int>& B, int i) { int c = 0, last = 0; for (int j = 0; j < B.size(); j++) { if (c > last) last = c; if (i + j < 0) continue; if (i + j >= A.size()) { break; } if (A[i + j] == B[j]) c++; if (c > last) last = c; if (A[i + j] != B[j]) c = 0; } return last; } int findLength(vector<int>& A, vector<int>& B) { int max = 0; int m = A.size(), n = B.size(); for (int i = 1 - n; i < m; i++) { int tmp = cnt(A, B, i); if (tmp > max) max = tmp; } return max; }};
54 / 54 test cases passed.
Status: Accepted
Runtime: 95 ms
阅读全文
0 0
- LeetCode718. Maximum Length of Repeated Subarray(Medium)
- LeetCode718. Maximum Length of Repeated Subarray
- 718[Medium]:Maximum Length of Repeated Subarray
- 718. Maximum Length of Repeated Subarray【Medium】 动归
- 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
- html基础标签笔记
- 在清单列表需要加入的权限
- SoftmaxWithLossLayer 详细讲解
- d3, geoJson 网站分享
- 洛谷 2285 打鼹鼠 递推? DP? 解题报告
- LeetCode718. Maximum Length of Repeated Subarray(Medium)
- 虔诚的墓主人 洛谷p2154
- lamp安装不上的问题(mysql也适用,不用重装ubuntu)
- 在嵌入式开发中比较 strncpy 和 memcpy 的区别
- idea设置main()方法快捷键
- zbar扫描java.lang.UnsatisfiedLinkError,无法找到so包
- H5-浮动和表单以及经纬度的查询
- 算法分析与设计——LeetCode:16. 3Sum Closest
- LINUX(CENTOS6.8固定ip方法)附录win方法