2017年11月7日
[LeetCode] 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 阅读全文
posted @ 2017-11-07 22:37 Grandyang 阅读(10408) 评论(16) 推荐(0)
Fork me on GitHub