给定两个整数 n 和 k,返回 1 … n 中所有可能的 k 个数的组合。
示例:
输入: n = 4, k = 2
输出:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]
这个题还是考虑DFS,深度优先搜索对于这种题目都是一种套路。
C++源代码:
class Solution {
public:
vector<vector<int>> combine(int n, int k) {
vector<vector<int>> res;
vector<int> out;
DFS(n, k, 1, out, res);
return res;
}
void DFS(int n, int k, int level, vector<int>& out, vector<vector<int>>& res)
{
if(out.size() == k){
res.push_back(out);
return;
}
for(int i=level;i<=n;i++){
out.push_back(i);
DFS(n, k, i+1, out, res);
out.pop_back();
}
}
};
python3源代码:
class Solution:
def combine(self, n, k):
"""
:type n: int
:type k: int
:rtype: List[List[int]]
"""
res = []
out = []
self.n = n+1
self.k = k
self.DFS(1, out, res)
return res
def DFS(self, level, out, res):
if len(out)==self.k:
res.append(copy.deepcopy(out))
return
for i in range(level, self.n):
out.append(i)
self.DFS(i+1, out, res)
out.pop()