mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
58 lines
3.1 KiB
HTML
58 lines
3.1 KiB
HTML
<p data-end="331" data-start="85">给你一个无向连通图,包含 <code data-end="137" data-start="134">n</code> 个节点,节点编号从 0 到 <code data-end="171" data-start="164">n - 1</code>,以及一个二维整数数组 <code data-end="202" data-start="195">edges</code>,其中 <code data-end="234" data-start="209">edges[i] = [u<sub>i</sub>, v<sub>i</sub>, w<sub>i</sub>]</code> 表示一条连接节点 <code data-end="279" data-start="275">u<sub>i</sub></code> 和节点 <code data-end="293" data-start="289">v<sub>i</sub></code> 的无向边,边权为 <code data-end="310" data-start="306">w<sub>i</sub></code>,另有一个整数 <code data-end="330" data-start="327">k</code>。</p>
|
||
|
||
<p data-end="461" data-start="333">你可以从图中移除任意数量的边,使得最终的图中 <strong>最多 </strong>只包含 <code data-end="439" data-start="436">k</code> 个连通分量。</p>
|
||
|
||
<p data-end="589" data-start="463">连通分量的 <strong>成本 </strong>定义为该分量中边权的 <strong>最大值 </strong>。如果一个连通分量没有边,则其代价为 0。</p>
|
||
|
||
<p data-end="760" data-start="661">请返回在移除这些边之后,在所有连通分量之中的 <strong>最大成本 </strong>的 <strong>最小可能值 </strong>。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong class="example">示例 1:</strong></p>
|
||
|
||
<div class="example-block">
|
||
<p><strong>输入:</strong> <span class="example-io">n = 5, edges = [[0,1,4],[1,2,3],[1,3,2],[3,4,6]], k = 2</span></p>
|
||
|
||
<p><strong>输出:</strong> <span class="example-io">4</span></p>
|
||
|
||
<p><strong>解释:</strong></p>
|
||
|
||
<p><img alt="" src="https://assets.leetcode.com/uploads/2025/04/19/minimizemaximumm.jpg" style="width: 535px; height: 225px;" /></p>
|
||
|
||
<ul>
|
||
<li data-end="1070" data-start="1021">移除节点 3 和节点 4 之间的边(权值为 6)。</li>
|
||
<li data-end="1141" data-start="1073">最终的连通分量成本分别为 0 和 4,因此最大代价为 4。</li>
|
||
</ul>
|
||
</div>
|
||
|
||
<p><strong class="example">示例 2:</strong></p>
|
||
|
||
<div class="example-block">
|
||
<p><strong>输入:</strong> <span class="example-io">n = 4, edges = [[0,1,5],[1,2,5],[2,3,5]], k = 1</span></p>
|
||
|
||
<p><strong>输出:</strong> <span class="example-io">5</span></p>
|
||
|
||
<p><strong>解释:</strong></p>
|
||
|
||
<p><img alt="" src="https://assets.leetcode.com/uploads/2025/04/19/minmax2.jpg" style="width: 315px; height: 55px;" /></p>
|
||
|
||
<ul>
|
||
<li data-end="1315" data-start="1251">无法移除任何边,因为只允许一个连通分量(<code>k = 1</code>),图必须保持完全连通。</li>
|
||
<li data-end="1389" data-start="1318">该连通分量的成本等于其最大边权,即 5。</li>
|
||
</ul>
|
||
</div>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示:</strong></p>
|
||
|
||
<ul>
|
||
<li><code>1 <= n <= 5 * 10<sup>4</sup></code></li>
|
||
<li><code>0 <= edges.length <= 10<sup>5</sup></code></li>
|
||
<li><code>edges[i].length == 3</code></li>
|
||
<li><code>0 <= u<sub>i</sub>, v<sub>i</sub> < n</code></li>
|
||
<li><code>1 <= w<sub>i</sub> <= 10<sup>6</sup></code></li>
|
||
<li><code>1 <= k <= n</code></li>
|
||
<li>输入图是连通图。</li>
|
||
</ul>
|