mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
35 lines
690 B
HTML
35 lines
690 B
HTML
<p>Given two integers <code>n</code> and <code>k</code>, return <em>all possible combinations of</em> <code>k</code> <em>numbers out of the range</em> <code>[1, n]</code>.</p>
|
|
|
|
<p>You may return the answer in <strong>any order</strong>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> n = 4, k = 2
|
|
<strong>Output:</strong>
|
|
[
|
|
[2,4],
|
|
[3,4],
|
|
[2,3],
|
|
[1,2],
|
|
[1,3],
|
|
[1,4],
|
|
]
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> n = 1, k = 1
|
|
<strong>Output:</strong> [[1]]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= n <= 20</code></li>
|
|
<li><code>1 <= k <= n</code></li>
|
|
</ul>
|