Combinations
来源:互联网 发布:淘宝购物如何追加评论 编辑:程序博客网 时间:2024/05/19 17:08
题目:
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
For example,
If n = 4 and k = 2, a solution is:
[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]
Subscribe to see which companies asked this question.
程序:
class Solution {
public:
vector<vector<int>> combine(int n, int k) {
vector<vector<int>> result;
int i = 0;
vector<int> p(k, 0);
while (i >= 0) {
p[i]++;
if (p[i] > n) --i;
else if (i == k - 1) result.push_back(p);
else {
++i;
p[i] = p[i - 1];
}
}
return result;
}
};
阅读全文
0 0
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- combinations
- Combinations
- Combinations
- Combinations
- Combinations
- CodeForces
- 第三周(1) app页面初步设计与代码编写
- 严重: 监听程序未启动或数据库服务未注册到该监听程序。解决方法
- springmvc原理
- android:在照片上绘制涂鸦
- Combinations
- unix域socket通信实例
- Spring Boot 是什么,有什么用。
- 搜索 B题
- Codeforces 808D Array Division【思维】
- Visual Studio 2015VS2015安装没有C++WIN32控制
- E: Unmet dependencies. Try 'apt-get -f install' with no packages (or specify a solution).
- jQuery:jQuery UI API
- 恢复误删除的数据