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

C++
vector<vector<int>> combine(int n, int k) {
        vector<vector<int>> res;
        vector<int> item;
        DFS(res,item,1,n,k);
        return res;
    }
    void DFS(vector<vector<int>>& res,vector<int> item,int start,int n,int k)
    {
        if(item.size() == k)
            res.push_back(item);
        else if(item.size() > k)
            return;
        else 
        {
            for(int i = start;i <= n;++i)
            {
                item.push_back(i);
                DFS(res,item,i+1,n,k);
                item.pop_back();
            }
        }
    }