718. Maximum Length of Repeated Subarray【Medium】 动归
来源:互联网 发布:淘宝开放平台 开发语言 编辑:程序博客网 时间:2024/05/17 23:07
题目:找两个数组的最长公共子数组
方法:与寻找子串的算法一样:设A数组长度m,B数组长度n
用dp[1~m][1~n]存当前位置到前面某个位置可以得到的最长子串长度
dp[i][j] = 0 --- A[i] != B[j]
dp[i-1][j-1] + 1 --- A[i] == B[j]
最后返回dp里最大的值
较简单
class Solution {public: int findLength(vector<int>& A, vector<int>& B) { int la = A.size(), lb = B.size(); vector<vector<int> > dp(la + 1, vector<int>(lb + 1)); for (int i = 0; i < la + 1; ++i) dp[i][0] = 0; for (int i = 0; i < lb + 1; ++i) dp[0][i] = 0; int max = 0; for (int i = 1; i < la + 1; ++i) { for (int j = 1; j < lb + 1; ++j) { if (A[i - 1] != B[j - 1]) dp[i][j] = 0; else if (max < (dp[i][j] = dp[i - 1][j - 1] + 1) ) max = dp[i][j]; } } return max; }};
阅读全文
0 0
- 718. Maximum Length of Repeated Subarray【Medium】 动归
- LeetCode718. Maximum Length of Repeated Subarray(Medium)
- 718[Medium]: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
- 718.Maximum Length of Repeated Subarray(M)
- 718. Maximum Length of Repeated Subarray
- 718. Maximum Length of Repeated Subarray
- 718. 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
- [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
- Python《机器学习实战》读书笔记(二)——k-近邻算法
- HIVE中 ROW_NUMBER() OVER() 函数
- 树状数组—(离散化)求比较大的数逆序数的个数
- ajax在什么情况下会走success和error
- next_permutation(全排列)
- 718. Maximum Length of Repeated Subarray【Medium】 动归
- 3.Git(版本控制的高级用法)
- Netty学习(四)—LengthFieldBasedFrameDecoder解码器
- spring表单标签学习笔记
- 第二十一天总结
- redis配置参数详解
- GAN
- 随便乱扯:软件开发中的布鲁克斯法则
- mac 安装 MySQL报错 -bash: mysql: command not found