本文共 625 字,大约阅读时间需要 2 分钟。
题目:
解答:
搜索,从前往后。
代码:
class Solution { public: vector> combine(int n, int k) { vector > res; vector temp; if (n < 1 || n < k || k < 1) return res; for (int i = 1; i <= n; i++) { temp.push_back(i); search(n, k, i, temp, res); temp.pop_back(); } return res; } void search(int n, int k, int last, vector &temp, vector< vector > &res) { if (temp.size() == k) { res.push_back(temp); return; } for (int i = last + 1; i <= n; i++) { temp.push_back(i); search(n, k, i, temp, res); temp.pop_back(); } } };
转载地址:http://gutsi.baihongyu.com/