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

修改错别字“路径”

Browse Source
This commit is contained in:
HUAWEI
2023-10-12 17:52:17 +08:00
parent f55518207f
commit 284143192c
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0797.所有可能的路径.md
View File

@ -89,7 +89,7 @@ if (x == graph.size() - 1) { // 找到符合条件的一条路径
for (int i = 0; i < graph[x].size(); i++) { // 遍历节点n链接的所有节点
```
接下来就是将 选中的x所连接的节点，加入到 单一路劲来。
接下来就是将 选中的x所连接的节点，加入到 单一路径来。
```C++
path.push_back(graph[x][i]); // 遍历到的节点加入到路径中来