lc77+Combinations

https://leetcode.com/problems/combinations/

class Solution {
public:
    vector<vector<int>>res;
    vector<int>temp;
    void DFS(int n, int k)
    {
        if(k==0){
            res.push_back(temp);
            return;
        }
        for(int i=n;i>0;i--){
            temp.push_back(i);
            DFS(i-1,k-1);
            temp.pop_back();
        }
    }
    vector<vector<int>> combine(int n, int k) {
        DFS(n,k);
        return res;
    }
};