leetcode 077 Combinations

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:
    void findONe(int n, int k, int cur, vector<int> ans, vector<vector<int>> &ret) {
		if(k==0) {
			ret.push_back(ans);
			return;
		}

		for(int i=cur; i<=n; i++) {
		    ans.push_back(i);
			findONe(n, k-1, i+1, ans, ret);
			ans.pop_back();
			
		}
	}
	
	vector<vector<int>> combine(int n, int k) {
		k = k >= n ? n : k;
		
        vector<vector<int> > ret;
        vector<int> ans;
        
        if(k == 0 || k == n) {
        	for(int i=1; i <= n; i++)
        		ans.push_back(i);
        	ret.push_back(ans);

        	return ret;
        }

		findONe(n,k,1,ans,ret);
		
		return ret;
	}
};*/

class Solution {
public:
    vector<vector<int> > combine(int n, int k) {
        vector<vector<int> >res;
        if(n<k)return res;
        vector<int> temp(0,k);
        combine(res,temp,0,0,n,k);
        return res;
    }

    void combine(vector<vector<int> > &res,vector<int> &temp,int start,int num,int n ,int k){
        if(num==k){
            res.push_back(temp);
            return;
        }
        for(int i = start;i<n;i++){
            temp.push_back(i+1);
            combine(res,temp,i+1,num+1,n,k);
            temp.pop_back();
            }
        }
};