LeetCode--77. Combinations

最新推荐文章于 2023-04-23 16:44:20 发布

冬风噬雪

最新推荐文章于 2023-04-23 16:44:20 发布

阅读量183

点赞数

分类专栏： LeetCode C++ 文章标签： Leetcode C++

本文链接：https://blog.csdn.net/u011319202/article/details/74170793

版权

LeetCode 同时被 2 个专栏收录

15 篇文章 0 订阅

订阅专栏

C++

12 篇文章 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],
]

解决代码：

class Solution {
public:
    vector<vector<int>> combine(int n, int k) {
        vector<int> numb;
        for(int i = 1; i <= n; i++)
        {
            numb.push_back(i);
        }
        vector<vector<int>> res;
        vector<int> solve;
        findCombine(res, solve, numb, 0, n, k);
        return res;
    }
private:
    void findCombine(vector<vector<int>>& res, vector<int>& solve, vector<int> numb, int start, int n, int k){
        if(solve.size() == k)
        {
            res.push_back(solve);
            return;
        }

        for(int i = start; i < n; i++)
        {
            solve.push_back(numb[i]);
            findCombine(res, solve, numb, i+1, n, k);
            solve.pop_back();
        }
    }

};