leetcode---combinations---dfs

最新推荐文章于 2022-10-13 11:31:43 发布

谛听-

最新推荐文章于 2022-10-13 11:31:43 发布

阅读量214

点赞数

分类专栏：回溯题

本文链接：https://blog.csdn.net/u012319493/article/details/78136647

版权

题同时被 2 个专栏收录

456 篇文章 1 订阅

订阅专栏

回溯

62 篇文章 3 订阅

订阅专栏

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

class Solution {
public:
    void dfs(int dep, int n, int k, vector< vector<int> > &ans, vector<int> &tmp)
    {
        if(tmp.size() == k)
        {
            ans.push_back(tmp);
        }

        for(int i=dep; i<=n; i++)
        {
            tmp.push_back(i);
            dfs(i+1, n, k, ans,tmp);
            tmp.pop_back();
        }
    }

    vector<vector<int> > combine(int n, int k) 
    {
        vector<int> tmp;
        vector< vector<int> > ans;
        dfs(1, n, k, ans, tmp);
        return ans;
    }
};