一刷718

Author: diguage

README.adoc

@@ -5051,14 +5051,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/0717-1-bit-and-2-bit-characters.adoc[题解]
 //|Easy
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/maximum-length-of-repeated-subarray/[718. Maximum Length of Repeated Subarray^]
-//|{source_base_url}/_0718_MaximumLengthOfRepeatedSubarray.java[Java]
-//|{doc_base_url}/0718-maximum-length-of-repeated-subarray.adoc[题解]
-//|Medium
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/maximum-length-of-repeated-subarray/[718. Maximum Length of Repeated Subarray^]
+|{source_base_url}/_0718_MaximumLengthOfRepeatedSubarray.java[Java]
+|{doc_base_url}/0718-maximum-length-of-repeated-subarray.adoc[题解]
+|Medium
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/find-k-th-smallest-pair-distance/[719. Find K-th Smallest Pair Distance^]
 //|{source_base_url}/_0719_FindKThSmallestPairDistance.java[Java]

docs/0000-26-dp-5-longest-common-substring.adoc

@@ -8,6 +8,7 @@
 . xref:0300-longest-increasing-subsequence.adoc[300. Longest Increasing Subsequence]
 . xref:1143-longest-common-subsequence.adoc[1143. Longest Common Subsequence]
 . xref:1092-shortest-common-supersequence.adoc[1092. Shortest Common Supersequence]
+. xref:0718-maximum-length-of-repeated-subarray.adoc[718. 最长重复子数组]
 
 Longest Common Substring，最长相同子串
 

docs/0718-maximum-length-of-repeated-subarray.adoc

@@ -1,38 +1,77 @@
 [#0718-maximum-length-of-repeated-subarray]
-= 718. Maximum Length of Repeated Subarray
+= 718. 最长重复子数组
 
-{leetcode}/problems/maximum-length-of-repeated-subarray/[LeetCode - Maximum Length of Repeated Subarray^]
+https://leetcode.cn/problems/maximum-length-of-repeated-subarray/[LeetCode - 718. 最长重复子数组 ^]
 
-Given two integer arrays `A` and `B`, return the maximum length of an subarray that appears in both arrays.
+给两个整数数组 `+nums1+` 和 `+nums2+` ，返回 _两个数组中 *公共的*
+、长度最长的子数组的长度 _。
 
-*Example 1:*
+*示例 1：*
 
-[subs="verbatim,quotes,macros"]
-----
-*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].
-----
+....
+输入：nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]
+输出：3
+解释：长度最长的公共子数组是 [3,2,1] 。
+....
+
+*示例 2：*
+
+....
+输入：nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]
+输出：5
+....
 
  
 
-*Note:*
+*提示：*
 
+* `+1 <= nums1.length, nums2.length <= 1000+`
+* `+0 <= nums1[i], nums2[i] <= 100+`
 
-. 1 <= len(A), len(B) <= 1000
-. 0 <= A[i], B[i] < 100
 
+== 思路分析
 
- 
+动态规划：
+
+image::images/0718-01.png[{image_attr}]
+
+image::images/0718-02.png[{image_attr}]
+
+image::images/0718-03.png[{image_attr}]
 
 
+滑动窗口的解法非常妙！
+
+image:images/0718-01.gif[{image_attr}]
+
 
 [[src-0718]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0718_MaximumLengthOfRepeatedSubarray.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0718_MaximumLengthOfRepeatedSubarray_2.java[tag=answer]
+// ----
+// --
+====
+
+
+== 参考资料
+
+. https://leetcode.cn/problems/maximum-length-of-repeated-subarray/solutions/310099/zui-chang-zhong-fu-zi-shu-zu-by-leetcode-solution/[718. 最长重复子数组 - 官方题解^]
+. https://leetcode.cn/problems/maximum-length-of-repeated-subarray/solutions/28583/wu-li-jie-fa-by-stg-2/[718. 最长重复子数组 - 滑动窗口解法^]
+. https://leetcode.cn/problems/maximum-length-of-repeated-subarray/solutions/310509/zhe-yao-jie-shi-ken-ding-jiu-dong-liao-by-hyj8/[718. 最长重复子数组 -「手画图解」动态规划 思路解析^]
+
 

docs/images/0718-01.gif

@@ -1510,7 +1510,7 @@ include::0714-best-time-to-buy-and-sell-stock-with-transaction-fee.adoc[leveloff
 
 // include::0717-1-bit-and-2-bit-characters.adoc[leveloffset=+1]
 
-// include::0718-maximum-length-of-repeated-subarray.adoc[leveloffset=+1]
+include::0718-maximum-length-of-repeated-subarray.adoc[leveloffset=+1]
 
 // include::0719-find-k-th-smallest-pair-distance.adoc[leveloffset=+1]
 

docs/images/0718-01.png

@@ -914,6 +914,11 @@
 |{doc_base_url}/0072-edit-distance.adoc[题解]
 |❌ 动态规划，看答案秒懂，自己想不出来！
 
+|{counter:codes}
+|{leetcode_base_url}/maximum-length-of-repeated-subarray/[718. Maximum Length of Repeated Subarray^]
+|{doc_base_url}/0718-maximum-length-of-repeated-subarray.adoc[题解]
+|❌ 动态规划。滑动窗口的解法也很妙！
+
 
 |===
 

docs/images/0718-02.png

@@ -0,0 +1,23 @@
+package com.diguage.algo.leetcode;
+
+public class _0718_MaximumLengthOfRepeatedSubarray {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-30 20:18:46
+   */
+  public int findLength(int[] nums1, int[] nums2) {
+    int n = nums1.length, m = nums2.length;
+    int[][] dp = new int[n + 1][m + 1];
+    int result = 0;
+    for (int i = n - 1; i >= 0; i--) {
+      for (int j = m - 1; j >= 0; j--) {
+        dp[i][j] = nums1[i] == nums2[j] ? dp[i + 1][j + 1] + 1 : 0;
+        result = Math.max(result, dp[i][j]);
+      }
+    }
+    return result;
+  }
+  // end::answer[]
+}