coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 19:01:47 +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

14
leetcode-cn/problem (Chinese)/组合总和 II [4sjJUc].html
View File

@@ -4,11 +4,11 @@
<p>&nbsp;</p>
<p><strong>示例&nbsp;1:</strong></p>
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入:</strong> candidates =&nbsp;<code>[10,1,2,7,6,1,5]</code>, target =&nbsp;<code>8</code>,
<strong>输出:</strong>
<strong>输入：</strong>candidates = [10,1,2,7,6,1,5], target = 8
<strong>输出：</strong>
[
[1,1,6],
[1,2,5],
@@ -16,11 +16,11 @@
[2,6]
]</pre>
<p><strong>示例&nbsp;2:</strong></p>
<p><strong>示例 2：</strong></p>
<pre>
<strong>输入:</strong> candidates =&nbsp;[2,5,2,1,2], target =&nbsp;5,
<strong>输出:</strong>
<strong>输入：</strong>candidates = [2,5,2,1,2], target = 5
<strong>输出：</strong>
[
[1,2,2],
[5]
@@ -28,7 +28,7 @@
<p>&nbsp;</p>
<p><strong>提示:</strong></p>
<p><strong>提示：</strong></p>
<ul>
<li><code>1 &lt;=&nbsp;candidates.length &lt;= 100</code></li>