[N-0] add 718

Author: fishercoder1534

README.md

@@ -23,6 +23,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |  #  |      Title     |   Solutions   | Time          | Space         | Difficulty  | Tag          | Notes
 |-----|----------------|---------------|---------------|---------------|-------------|--------------|-----
 |719|[Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_719.java) | O(nlogw + nlogn) | O(1) | Hard | Binary Search
+|718|[Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_718.java) | O(m*n) | O(m*n) | Medium | DP
 |717|[1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_717.java) | O(n) | O(1) | Easy |
 |714|[Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_714.java) | O(n) | O(1) | Medium | DP
 |713|[Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_713.java) | O(n) | O(1) | Medium |

src/main/java/com/fishercoder/solutions/_718.java

@@ -0,0 +1,39 @@
+package com.fishercoder.solutions;
+
+/**
+ * 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].
+ Note:
+ 1 <= len(A), len(B) <= 1000
+ 0 <= A[i], B[i] < 100
+ */
+public class _718 {
+    public static class Solution1 {
+        public int findLength(int[] A, int[] B) {
+            if (A == null || B == null || A.length == 0 || B.length == 0) {
+                return 0;
+            }
+            int[][] dp = new int[A.length + 1][B.length + 1];
+            int result = 0;
+            for (int i = A.length - 1; i >= 0; i--) {
+                for (int j = B.length - 1; j >= 0; j--) {
+                    if (A[i] == B[j]) {
+                        dp[i][j] = dp[i + 1][j + 1] + 1;
+                    }
+                    result = Math.max(result, dp[i][j]);
+                }
+            }
+            return result;
+        }
+    }
+}