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

回溯法，nums存储数组[1,2,3…n]，out存储组合，ans存储最终的答案.

class Solution {
public:
    vector<vector<int>> combine(int n, int k) {
        vector<vector<int>> ans;
        vector<int> nums;
        for (int i = 1; i <= n; i++) {
            nums.push_back(i);
        }
        //vector<bool> visited(nums.size(), false);
        vector<int> out;
        DFS(nums, 0, k, out, ans);
        return ans;
    }

    void DFS(vector<int>& nums, int level, int k, vector<int>& out, vector<vector<int>>& ans) {
        if (out.size() == k) ans.push_back(out);
        else {
            for (int i = level; i < nums.size(); i++) {
                //if (!visited[i]) {
                  //  visited[i] = true;
                    out.push_back(nums[i]);
                    DFS(nums, i+1, k, out, ans);
                    //visited[i] = false;
                    out.pop_back();
            }
        }
    }


};