coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-12 17:05:15 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode-cn/problem (Chinese)/组合总和 [combination-sum].html
View File

@@ -9,7 +9,7 @@
<p><strong>示例&nbsp;1：</strong></p>
<pre>
<strong>输入：</strong>candidates = <code>[2,3,6,7]</code>, target = <code>7</code>
<strong>输入：</strong>candidates = [2,3,6,7], target = 7
<strong>输出：</strong>[[2,2,3],[7]]
<strong>解释：</strong>
2 和 3 可以形成一组候选，2 + 2 + 3 = 7 。注意 2 可以使用多次。
@@ -19,13 +19,13 @@
<p><strong>示例&nbsp;2：</strong></p>
<pre>
<strong>输入: </strong>candidates = [2,3,5]<code>, </code>target = 8
<strong>输入: </strong>candidates = [2,3,5], target = 8
<strong>输出: </strong>[[2,2,2,2],[2,3,3],[3,5]]</pre>
<p><strong>示例 3：</strong></p>
<pre>
<strong>输入: </strong>candidates = <code>[2], </code>target = 1
<strong>输入: </strong>candidates = [2], target = 1
<strong>输出: </strong>[]
</pre>