solution_718

最新推荐文章于 2022-09-02 20:47:30 发布

哲学加农炮

最新推荐文章于 2022-09-02 20:47:30 发布

阅读量117

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_40132934/article/details/78948417

版权

LeetCode 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

LeetCode Problem 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

Solution

In this problem, we can store the temporary maximum length of the arrays. The code is as following:

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

This is obvious that when we compare each element of one vector A to every element of the other vector B in a loop, if there is any previous element of A is equal to any element of B that is next to the current equal element in B then we can sum them and compare with the previous maximum length of the subarray. In this way, we can finally get the result we want.