[Leetcode]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:
    vector<vector<int> > combine(int n, int k) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<vector<int>> results;
        vector<int> result;
        getCombine(1,n,k,result,results);
        return results;
    }
    
    void getCombine(int init, int n, int k, vector<int> result, vector<vector<int>>& results)
    {
        if(n-init+1<k) return;
        if(k==0)
        {
            results.push_back(result);
        }
        
        for(int i=init; i<=n ; i++)
        {
            result.push_back(i);
            getCombine(i+1,n,k-1,result,results);
            result.pop_back();
        }
    }
};