mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
33 lines
1.4 KiB
HTML
33 lines
1.4 KiB
HTML
|
<p>There are <code>n</code> servers numbered from <code>0</code> to <code>n - 1</code> connected by undirected server-to-server <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between servers <code>a<sub>i</sub></code> and <code>b<sub>i</sub></code>. Any server can reach other servers directly or indirectly through the network.</p>
|
||
|
|
|
||
|
|
<p>A <em>critical connection</em> is a connection that, if removed, will make some servers unable to reach some other server.</p>
|
||
|
|
|
||
|
|
<p>Return all critical connections in the network in any order.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2019/09/03/1537_ex1_2.png" style="width: 198px; height: 248px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> n = 4, connections = [[0,1],[1,2],[2,0],[1,3]]
|
||
|
|
<strong>Output:</strong> [[1,3]]
|
||
|
|
<strong>Explanation:</strong> [[3,1]] is also accepted.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> n = 2, connections = [[0,1]]
|
||
|
|
<strong>Output:</strong> [[0,1]]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>2 <= n <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>n - 1 <= connections.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>0 <= a<sub>i</sub>, b<sub>i</sub> <= n - 1</code></li>
|
||
|
|
<li><code>a<sub>i</sub> != b<sub>i</sub></code></li>
|
||
|
|
<li>There are no repeated connections.</li>
|
||
|
|
</ul>
|