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

Solution:

class Solution {
public:
    vector<vector<int>> combine(int n, int k) {
        vector<vector<int> > res;
        if(n < 1 || k > n) return res;
        vector<int> v;
        dfs(n, k, 1, 1, v, res);
        
        return res;
    }
    void dfs(int n, int k, int start, int depth, vector<int> &v, vector<vector<int> > &res)
    {
        if(start > n) return ;
        for(int i = start; i <= n; ++i)
        {
            v.push_back(i);
            if(depth == k) res.push_back(v);
            else dfs(n, k, i + 1, depth + 1, v, res);
            v.pop_back();
        }
    }
};