LeetCode #77 - Combinations

题目描述：

Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.

Example:

Input: n = 4, k = 2
Output:
[
  [2,4],
  [3,4],
  [2,3],
  [1,2],
  [1,3],
  [1,4],
]

显然采用递归的解法，由于不存在重复元素，较为简单。

class Solution {
public:
    vector<vector<int>> combine(int n, int k) {
        int i=1;
        vector<int> cur;
        vector<vector<int>> result;
        combine_recur(n,k,i,cur,result);
        return result;
    }
    
    void combine_recur(int n, int k, int i, vector<int> cur, vector<vector<int>> &result)
    {
        if(cur.size()==k) 
        {
            result.push_back(cur);
            return;
        }
        if(i>n) return;
        combine_recur(n,k,i+1,cur,result);
        cur.push_back(i);
        combine_recur(n,k,i+1,cur,result);
    }
};