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:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
leetcode-cn/problem (English)/大礼包(English) [shopping-offers].html
View File

@@ -39,4 +39,5 @@ You cannot add more items, though only $9 for 2A ,2B and 1C.
<li><code>1 &lt;= special.length &lt;= 100</code></li>
<li><code>special[i].length == n + 1</code></li>
<li><code>0 &lt;= special[i][j] &lt;= 50</code></li>
<li>The input is generated that at least one of <code>special[i][j]</code> is non-zero for <code>0 &lt;= j &lt;= n - 1</code>.</li>
</ul>