[LeetCode] Combination, Permutation, subsets

三道几乎一样的题 递归~

Combination：

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],
]

class Solution { public: void getcombine(int start, int end, int k, vector<int> &temp, vector<vector<int>> &result) { if(temp.size() == k) { result.push_back(temp); return; } for(int i = start; i <= end; i++) { temp.push_back(i); getcombine(i+1,end,k,temp,result); temp.pop_back(); } } vector<vector<int> > combine(int n, int k) { vector<vector<int> > result; vector<int> temp; getcombine(1,n,k, temp,result); return result; } }; </int></int></int></int></int>

Permutation：

Given a collection of numbers, return all possible permutations.

For example,
[1,2,3] have the following permutations:
[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].

class Solution { public: vector<vector<int> > result; vector<vector<int> > permute(vector<int> &num) { // Start typing your C/C++ solution below // DO NOT write int main() function permute(num, 0); return result; } void permute(vector<int> &num, int start) { if(start == num.size()) { result.push_back(num); } for(int i = start; i < num.size(); ++i) { swap(num[i], num[start]); permute(num, start+1); swap(num[i], num[start]); } } }; </int></int></int></int>

subsets：

Given a set of distinct integers, S, return all possible subsets.

Note:

• Elements in a subset must be in non-descending order.
• The solution set must not contain duplicate subsets.

For example,
If S = [1,2,3], a solution is:

[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

class Solution { public: void getsubset(int start, int end,int k, vector<int> &temp, vector<vector<int>> &result,vector<int> &S) { if(temp.size() == k) { result.push_back(temp); return; } for(int i = start; i <=end; i++) { temp.push_back(S[i]); getsubset(i+1,end,k,temp,result,S); temp.pop_back(); } } vector<vector<int> > subsets(vector<int> &S) { vector<vector<int>> result; vector<int> temp; int num = S.size(); sort(S.begin(), S.end()); for(int i = 0; i <= num; i++) { getsubset(0,num-1,i,temp,result,S); } return result; } }; </int></int></int></int></int></int></int>