mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
41 lines
1.8 KiB
HTML
41 lines
1.8 KiB
HTML
<p>There is a bag that consists of items, each item has a number <code>1</code>, <code>0</code>, or <code>-1</code> written on it.</p>
|
|
|
|
<p>You are given four <strong>non-negative </strong>integers <code>numOnes</code>, <code>numZeros</code>, <code>numNegOnes</code>, and <code>k</code>.</p>
|
|
|
|
<p>The bag initially contains:</p>
|
|
|
|
<ul>
|
|
<li><code>numOnes</code> items with <code>1</code>s written on them.</li>
|
|
<li><code>numZeroes</code> items with <code>0</code>s written on them.</li>
|
|
<li><code>numNegOnes</code> items with <code>-1</code>s written on them.</li>
|
|
</ul>
|
|
|
|
<p>We want to pick exactly <code>k</code> items among the available items. Return <em>the <strong>maximum</strong> possible sum of numbers written on the items</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> numOnes = 3, numZeros = 2, numNegOnes = 0, k = 2
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong> We have a bag of items with numbers written on them {1, 1, 1, 0, 0}. We take 2 items with 1 written on them and get a sum in a total of 2.
|
|
It can be proven that 2 is the maximum possible sum.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> numOnes = 3, numZeros = 2, numNegOnes = 0, k = 4
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> We have a bag of items with numbers written on them {1, 1, 1, 0, 0}. We take 3 items with 1 written on them, and 1 item with 0 written on it, and get a sum in a total of 3.
|
|
It can be proven that 3 is the maximum possible sum.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>0 <= numOnes, numZeros, numNegOnes <= 50</code></li>
|
|
<li><code>0 <= k <= numOnes + numZeros + numNegOnes</code></li>
|
|
</ul>
|