mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
37 lines
803 B
HTML
37 lines
803 B
HTML
<p>给定两个整数 <code>n</code> 和 <code>k</code>，返回 <code>1 ... n</code> 中所有可能的 <code>k</code> 个数的组合。</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>
|
|
|
|
<p> </p>
|
|
|
|
<p><meta charset="UTF-8" />注意：本题与主站 77 题相同： <a href="https://leetcode-cn.com/problems/combinations/">https://leetcode-cn.com/problems/combinations/</a></p>
|