[Leetcode77, medium] Combination

Problem:

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:

Accepted in one time.

Programs:

void getCombine(vector<vector<int> > &setCombine, vector<int> &combine,  int upperBound, int startIndex, int num){
        if(num==1){
            for(int i=startIndex; i<=upperBound; ++i){
                combine.push_back(i);
                setCombine.push_back(combine);
                combine.pop_back();
            }
        }else{
            for(int i=startIndex; i<=upperBound; ++i){
                combine.push_back(i);
                getCombine(setCombine, combine, upperBound, i+1, num-1);
                combine.pop_back();
            }
        }
    }
    vector<vector<int> > combine(int n, int k) {
        vector<vector<int> > setCombine;
        vector<int> combine;
        getCombine(setCombine, combine, n, 1, k);
        return setCombine;
        
    }