coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-19 20:16:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
leetcode-cn/problem (Chinese)/节点间通路 [route-between-nodes-lcci].html Normal file
View File

@@ -0,0 +1,21 @@
<p>节点间通路。给定有向图，设计一个算法，找出两个节点之间是否存在一条路径。</p>
<p><strong>示例1:</strong></p>
<pre><strong> 输入</strong>：n = 3, graph = [[0, 1], [0, 2], [1, 2], [1, 2]], start = 0, target = 2
<strong> 输出</strong>：true
</pre>
<p><strong>示例2:</strong></p>
<pre><strong> 输入</strong>：n = 5, graph = [[0, 1], [0, 2], [0, 4], [0, 4], [0, 1], [1, 3], [1, 4], [1, 3], [2, 3], [3, 4]], start = 0, target = 4
<strong> 输出</strong> true
</pre>
<p><strong>提示：</strong></p>
<ol>
<li>节点数量n在[0, 1e5]范围内。</li>
<li>节点编号大于等于 0 小于 n。</li>
<li>图中可能存在自环和平行边。</li>
</ol>