LeetCode-718. Maximum Length of Repeated Subarray

最新推荐文章于 2023-02-25 22:41:55 发布

weixin_30326515

最新推荐文章于 2023-02-25 22:41:55 发布

阅读量133

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/zhacai/p/11160652.html

博客给出两个整数数组，要求返回在两个数组中都出现的公共子数组的最大长度，并给出示例及数组长度和元素范围的限制，还给出了转载来源。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

iven 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

    public int findLength(int[] A, int[] B) {
        int len1 = A.length;
        int len2 = B.length;
        int[][] flag = new int[len1+1][len2+1];
        int max =0;
        for(int i = 0; i<len1;i++){
            for(int j= 0;j<len2;j++){
                flag[i+1][j+1]= A[i]==B[j]?flag[i][j]+1:0;
                max = flag[i+1][j+1]>max?flag[i+1][j+1]:max;
            }
        }
        return max;
    }