algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 02:53:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

update 不同路径II.md

Browse Source 
更正文档错别字
This commit is contained in:
花无缺
2023-04-09 14:54:51 +08:00
parent ba03a17e68
commit e68a8a379b
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0063.不同路径II.md
View File

@ -135,7 +135,7 @@ for (int i = 1; i < m; i++) {
![63.不同路径II2](https://code-thinking-1253855093.file.myqcloud.com/pics/20210104114610256.png)
如果这个图看不同，建议在理解一下递归公式，然后照着文章中说的遍历顺序，自己推导一下！
如果这个图看不懂，建议再理解一下递归公式，然后照着文章中说的遍历顺序，自己推导一下！
动规五部分分析完毕，对应C++代码如下：