mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 11:08:15 +08:00
35 lines
650 B
HTML
35 lines
650 B
HTML
|
<p>给定两个整数 <code>n</code> 和 <code>k</code>，返回范围 <code>[1, n]</code> 中所有可能的 <code>k</code> 个数的组合。</p>
|
|||
|
|
|
|||
|
|
<p>你可以按 <strong>任何顺序</strong> 返回答案。</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>
|