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

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
leetcode-cn/problem (English)/节点间通路(English) [route-between-nodes-lcci].html
View File

@@ -1,23 +1,23 @@
<p>Given a directed graph, design an algorithm to find out whether there is a route between two nodes.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: n = 3, graph = [[0, 1], [0, 2], [1, 2], [1, 2]], start = 0, target = 2
<strong> Output</strong>: true
</pre>
<p><strong>Example2:</strong></p>
<pre>
<strong> Input</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> Output</strong> true
</pre>
<p><strong>Note: </strong></p>
<ol>
<li><code>0 &lt;= n &lt;= 100000</code></li>
<li>All node numbers are within the range [0, n].</li>
<li>There might be self cycles and duplicated edges.</li>
</ol>
<p>Given a directed graph, design an algorithm to find out whether there is a route between two nodes.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: n = 3, graph = [[0, 1], [0, 2], [1, 2], [1, 2]], start = 0, target = 2
<strong> Output</strong>: true
</pre>
<p><strong>Example2:</strong></p>
<pre>