---
# System prepended metadata

title: 0718. Maximum Length of Repeated Subarray
tags: [Leetcode, Dynamic Programming, Medium]

---

# 0718. Maximum Length of Repeated Subarray
###### tags: `Leetcode` `Dynamic Programming` `Medium`
Link: https://leetcode.com/problems/maximum-length-of-repeated-subarray/
## 思路
```dp[i][j]```表示以```nums1[i]```结尾的subarray和以```nums2[j]```结尾的subarray相等的最大长度
```dp[i][j] = dp[i-1][j-1]+1``` if ```nums1[i]==nums2[j]```
## Code
```java=
class Solution {
    public int findLength(int[] nums1, int[] nums2) {
        int m = nums1.length, n = nums2.length;
        int[][] dp = new int[m+1][n+1];
        int ans = 0;
        for(int i=1; i<=m; i++){
            for(int j=1; j<=n; j++){
                if(nums1[i-1]==nums2[j-1]){
                    dp[i][j] = dp[i-1][j-1]+1;
                }
                
                ans = Math.max(dp[i][j], ans);
            }
        }
        return ans;
    }
}
```