leetcode Combinations
来源:互联网 发布:海康无网络视频 编辑:程序博客网 时间:2024/06/05 13:35
class Solution {
public:
vector<vector<int>> res;
void dfs(vector<bool> &used,int t,int n,int k,int start)
{
if(t>k)
{
vector<int> re;
for(int i=1;i<=n;i++)
if(used[i]==1)
re.push_back(i); // 1~n
res.push_back(re);
return;
}
if(n-start+1<k-t+1)
return;
for(int i=start;i<=n;i++)
{
used[i]=1;
dfs(used,t+1,n,k,i+1);
used[i]=0;
}
}
vector<vector<int>> combine(int n, int k) {
vector<bool> used(n+1,false);
dfs(used,1, n, k, 1);
returnres;
}
};
超过百分之九十三的数据哦 开心
阅读全文
0 0
- LeetCode: Combinations
- LeetCode: Combinations
- LeetCode Combinations
- [Leetcode] Combinations
- [LeetCode] Combinations
- Leetcode: Combinations
- LeetCode Combinations
- [Leetcode] Combinations
- [Leetcode] Combinations
- [leetcode] Combinations
- [LeetCode]Combinations
- [leetcode]Combinations
- LeetCode-Combinations
- [leetcode] Combinations
- LeetCode - Combinations
- 【Leetcode】Combinations
- Leetcode: Combinations
- 【leetcode】Combinations
- Ajax创建案例
- 20171101
- 图像识别与处理之Opencv——选取图像局部区域
- 阿里中间件需要怎样的架构师
- 设置 UINavigationBar 全局颜色,背景颜色,前景颜色 swift 3 4 ios 10 +
- leetcode Combinations
- 20171031|课堂作业01 业务类抽象
- 递归
- 15.32
- Latex中文处理
- (已解决)UVA11642 Fire!(两次BFS~)
- awk中next用法
- Cortex-M/R/A 芯片&内核&架构
- 我的电路实践