Combinations

最新推荐文章于 2021-02-15 17:16:30 发布

chunxia75qin

最新推荐文章于 2021-02-15 17:16:30 发布

阅读量425

点赞数

分类专栏： c++ code 文章标签： LeetCode 算法 c++

本文链接：https://blog.csdn.net/chunxia75qin/article/details/8974380

版权

c++ code 专栏收录该内容

60 篇文章 0 订阅

订阅专栏

题目：

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

代目如下：

    void subcomb(int &n,int &k,int count,int currentindex,vector<vector<int> > &result,vector<int> &tmp)
    {
        if(count==k)
        {
            result.push_back(tmp);
            return;
        }
        if(currentindex>n)return;
        tmp.push_back(currentindex);
        subcomb(n,k,count+1,currentindex+1,result,tmp);
        tmp.pop_back();
        subcomb(n,k,count,currentindex+1,result,tmp);
    }
    vector<vector<int> > combine(int n, int k)
    {
        vector<vector<int> > result;
        vector<int> tmp;
        subcomb(n,k,0,1,result,tmp);
        return result;
    }
};