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

update

Browse Source
This commit is contained in:
小墨
2024-10-10 00:43:17 +08:00
parent 76e35939b6
commit 921e076c8e
66 changed files with 23144 additions and 15758 deletions
Download Patch File Download Diff File Expand all files Collapse all files

57
leetcode-cn/problem (Chinese)/高度互不相同的最大塔高和 [maximize-the-total-height-of-unique-towers].html Normal file
View File

@@ -0,0 +1,57 @@
<p>给你一个数组&nbsp;<code>maximumHeight</code>&nbsp;，其中&nbsp;<code>maximumHeight[i]</code>&nbsp;表示第 <code>i</code>&nbsp;座塔可以达到的 <strong>最大</strong>&nbsp;高度。</p>
<p>你的任务是给每一座塔分别设置一个高度，使得：</p>
<ol>
<li>第 <code>i</code>&nbsp;座塔的高度是一个正整数，且不超过&nbsp;<code>maximumHeight[i]</code>&nbsp;。</li>
<li>所有塔的高度互不相同。</li>
</ol>
<p>请你返回设置完所有塔的高度后，可以达到的 <strong>最大</strong>&nbsp;总高度。如果没有合法的设置，返回 <code>-1</code>&nbsp;。</p>
<p>&nbsp;</p>
<p><strong class="example">示例 1：</strong></p>
<div class="example-block">
<p><b>输入：</b>maximumHeight<span class="example-io"> = [2,3,4,3]</span></p>
<p><span class="example-io"><b>输出：</b>10</span></p>
<p><strong>解释：</strong></p>
<p>我们可以将塔的高度设置为：<code>[1, 2, 4, 3]</code>&nbsp;。</p>
</div>
<p><strong class="example">示例 2：</strong></p>
<div class="example-block">
<p><b>输入：</b>maximumHeight<span class="example-io"> = [15,10]</span></p>
<p><span class="example-io"><b>输出：</b>25</span></p>
<p><strong>解释：</strong></p>
<p>我们可以将塔的高度设置为：<code>[15, 10]</code>&nbsp;。</p>
</div>
<p><strong class="example">示例 3：</strong></p>
<div class="example-block">
<p><b>输入：</b>maximumHeight<span class="example-io"> = [2,2,1]</span></p>
<p><span class="example-io"><b>输出：</b>-1</span></p>
<p><b>解释：</b></p>
<p>无法设置塔的高度为正整数且高度互不相同。</p>
</div>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>
<ul>
<li><code>1 &lt;= maximumHeight.length&nbsp;&lt;= 10<sup>5</sup></code></li>
<li><code>1 &lt;= maximumHeight[i] &lt;= 10<sup>9</sup></code></li>
</ul>