Update
This commit is contained in:
@@ -23,6 +23,11 @@
|
||||
* 1 <= len(A), len(B) <= 1000
|
||||
* 0 <= A[i], B[i] < 100
|
||||
|
||||
## 算法公开课
|
||||
|
||||
**《代码随想录》算法视频公开课:[动态规划之子序列问题,想清楚DP数组的定义 | LeetCode:718.最长重复子数组](https://www.bilibili.com/video/BV178411H7hV),相信结合视频再看本篇题解,更有助于大家对本题的理解**。
|
||||
|
||||
|
||||
|
||||
## 思路
|
||||
|
||||
|
||||
Reference in New Issue
Block a user