leetcode——77——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],]

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

        combination(1,n,k);
        return res;
    }
    void combination(int start,int n, int k)
    {
        if(k == 0)
        {
             res.push_back(ans);
             return;
        }
            
        for(int i = start; i<=n ; i++)
        {
            ans.push_back(i);
            combination(++start,n,k-1);
            ans.pop_back();
        }
    }
};