)
链接718. 最长重复子数组 - 力扣LeetCode因为要求连续的子数组class Solution { public: int findLength(vectorint A, vectorint B) { if (A.size() 0 || B.size() 0) { return 0; } vectorvectorint dp(A.size()1, vectorint(B.size()1, 0)); int max_len 0; for (int i 1; i A.size(); i) { for (int j 1; j B.size(); j) { if (A[i-1] B[j-1]) { dp[i][j] dp[i-1][j-1] 1; } else { dp[i][j] 0; } max_len max(max_len, dp[i][j]); } } return max_len; } }; 718. 最长重复子数组(dp maximum双序列)
链接718. 最长重复子数组 - 力扣LeetCode因为要求连续的子数组class Solution { public: int findLength(vectorint A, vectorint B) { if (A.size() 0 || B.size() 0) { return 0; } vectorvectorint dp(A.size()1, vectorint(B.size()1, 0)); int max_len 0; for (int i 1; i A.size(); i) { for (int j 1; j B.size(); j) { if (A[i-1] B[j-1]) { dp[i][j] dp[i-1][j-1] 1; } else { dp[i][j] 0; } max_len max(max_len, dp[i][j]); } } return max_len; } }; RELATED READING
延伸阅读
更多一线实战笔记与深度复盘，助您持续精进
