add leetcode problem-cn part2

算法题（国内版）/problem (Chinese)/节点间通路 [route-between-nodes-lcci].html

@@ -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>