mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
50 lines
2.3 KiB
HTML
50 lines
2.3 KiB
HTML
<p>You are given an integer array <code>nums</code> where the <code>i<sup>th</sup></code> bag contains <code>nums[i]</code> balls. You are also given an integer <code>maxOperations</code>.</p>
|
|
|
|
<p>You can perform the following operation at most <code>maxOperations</code> times:</p>
|
|
|
|
<ul>
|
|
<li>Take any bag of balls and divide it into two new bags with a <strong>positive </strong>number of balls.
|
|
|
|
<ul>
|
|
<li>For example, a bag of <code>5</code> balls can become two new bags of <code>1</code> and <code>4</code> balls, or two new bags of <code>2</code> and <code>3</code> balls.</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
|
|
<p>Your penalty is the <strong>maximum</strong> number of balls in a bag. You want to <strong>minimize</strong> your penalty after the operations.</p>
|
|
|
|
<p>Return <em>the minimum possible penalty after performing the operations</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [9], maxOperations = 2
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong>
|
|
- Divide the bag with 9 balls into two bags of sizes 6 and 3. [<strong><u>9</u></strong>] -> [6,3].
|
|
- Divide the bag with 6 balls into two bags of sizes 3 and 3. [<strong><u>6</u></strong>,3] -> [3,3,3].
|
|
The bag with the most number of balls has 3 balls, so your penalty is 3 and you should return 3.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [2,4,8,2], maxOperations = 4
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong>
|
|
- Divide the bag with 8 balls into two bags of sizes 4 and 4. [2,4,<strong><u>8</u></strong>,2] -> [2,4,4,4,2].
|
|
- Divide the bag with 4 balls into two bags of sizes 2 and 2. [2,<strong><u>4</u></strong>,4,4,2] -> [2,2,2,4,4,2].
|
|
- Divide the bag with 4 balls into two bags of sizes 2 and 2. [2,2,2,<strong><u>4</u></strong>,4,2] -> [2,2,2,2,2,4,2].
|
|
- Divide the bag with 4 balls into two bags of sizes 2 and 2. [2,2,2,2,2,<strong><u>4</u></strong>,2] -> [2,2,2,2,2,2,2,2].
|
|
The bag with the most number of balls has 2 balls, so your penalty is 2, and you should return 2.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= maxOperations, nums[i] <= 10<sup>9</sup></code></li>
|
|
</ul>
|