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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 18:53:53 +08:00
parent c9b1bf36a8
commit 9bc4722a45
349 changed files with 15897 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
leetcode-cn/problem (Chinese)/库存管理 III [zui-xiao-de-kge-shu-lcof].html Normal file
View File

@@ -0,0 +1,27 @@
<p>仓库管理员以数组 <code>stock</code> 形式记录商品库存表，其中 <code>stock[i]</code> 表示对应商品库存余量。请返回库存余量最少的 <code>cnt</code> 个商品余量，返回&nbsp;<strong>顺序不限</strong>。</p>
<p>&nbsp;</p>
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入：</strong>stock = [2,5,7,4], cnt = 1
<strong>输出：</strong>[2]
</pre>
<p><strong>示例 2：</strong></p>
<pre>
<strong>输入：</strong>stock = [0,2,3,6], cnt = 2
<strong>输出：</strong>[0,2] 或 [2,0]</pre>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>
<ul>
<li><code>0 &lt;= cnt &lt;= stock.length &lt;= 10000<br />
0 &lt;= stock[i] &lt;= 10000</code></li>
</ul>
<p>&nbsp;</p>