35 lines
739 B
Markdown
35 lines
739 B
Markdown
|
<p>给定两个整数 <code>n</code> 和 <code>k</code>，返回 <code>1 ... n</code> 中所有可能的 <code>k</code> 个数的组合。</p>
|
|||
|
|
|
|||
|
|
<p>你可以按任何顺序返回答案。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1:</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入:</strong> n = 4, k = 2
|
|||
|
|
<strong>输出:</strong>
|
|||
|
|
[
|
|||
|
|
[2,4],
|
|||
|
|
[3,4],
|
|||
|
|
[2,3],
|
|||
|
|
[1,2],
|
|||
|
|
[1,3],
|
|||
|
|
[1,4],
|
|||
|
|
]</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2:</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入:</strong> n = 1, k = 1
|
|||
|
|
<strong>输出: </strong>[[1]]</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示:</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= n <= 20</code></li>
|
|||
|
|
<li><code>1 <= k <= n</code></li>
|
|||
|
|
</ul>
|
|||
|
|
<div><div>Related Topics</div><div><li>数组</li><li>回溯</li></div></div>\n<div><li>👍 626</li><li>👎 0</li></div>
|