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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
leetcode-cn/problem (Chinese)/使数组相等的最小开销 [minimum-cost-to-make-array-equal].html
View File

@@ -14,7 +14,8 @@
<p><strong>示例 1：</strong></p>
<pre><b>输入：</b>nums = [1,3,5,2], cost = [2,3,1,14]
<pre>
<b>输入：</b>nums = [1,3,5,2], cost = [2,3,1,14]
<b>输出：</b>8
<b>解释：</b>我们可以执行以下操作使所有元素变为 2 ：
- 增加第 0 个元素 1 次，开销为 2 。
@@ -26,7 +27,8 @@
<p><strong>示例 2：</strong></p>
<pre><b>输入：</b>nums = [2,2,2,2,2], cost = [4,2,8,1,3]
<pre>
<b>输入：</b>nums = [2,2,2,2,2], cost = [4,2,8,1,3]
<b>输出：</b>0
<b>解释：</b>数组中所有元素已经全部相等，不需要执行额外的操作。
</pre>
@@ -39,4 +41,5 @@
<li><code>n == nums.length == cost.length</code></li>
<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
<li><code>1 &lt;= nums[i], cost[i] &lt;= 10<sup>6</sup></code></li>
<li>测试用例确保输出不超过 2<sup>53</sup>-1。</li>
</ul>