Leetcode 算法设计 第十四周

718. 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].

题目大意

找出两数组中最长相同子数组

我的解答

class Solution {public:    int findLength(vector<int>& A, vector<int>& B) {        int m = A.size();        int n = B.size();        int result = 0;        vector<vector<int>>dp(m+1,vector<int>(n+1,0));        for(int i = 1; i <= m; i++){            for(int j = 1; j <= n; j++){               if(A[i-1]==B[j-1]){                   dp[i][j] = dp[i-1][j-1]+1;                   result = max(result,dp[i][j]);               }            }        }        return result;    }};