-
Notifications
You must be signed in to change notification settings - Fork 1.3k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
e7bfd05
commit cdef17e
Showing
1 changed file
with
2 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,5 @@ | ||
### 329.Longest-Increasing-Path-in-a-Matrix | ||
|
||
我们从任意点A开始递归寻找各条递增路径,最终返回的时候记录从A为起点时的最长路径长度。将此结果记忆化,这样当对其他点进行DFS的时候,如果递归调用到dfs(A)就直接返回结果。 | ||
|
||
此题和[2328.Number-of-Increasing-Paths-in-a-Grid](https://github.com/wisdompeak/LeetCode/tree/master/DFS/2328.Number-of-Increasing-Paths-in-a-Grid)非常类似。 |