C++中M盒中N个球的组合列表

#include <iostream>
#include <vector>

using namespace std;

// 递归生成组合列表
void generateCombination(int m, int n, vector<int>& combination, vector<vector<int>>& result) {
    if (combination.size() == n) {
        result.push_back(combination);
        return;
    }

    int start = combination.empty() ? 1 : combination.back() + 1;
    for (int i = start; i <= m; i++) {
        combination.push_back(i);
        generateCombination(m, n, combination, result);
        combination.pop_back();
    }
}

int main() {
    int m = 3; // 盒子数量
    int n = 2; // 球的数量

    vector<int> combination;
    vector<vector<int>> result;

    generateCombination(m, n, combination, result);

    // 输出组合列表
    for (const auto& comb : result) {
        for (int i : comb) {
            cout << i << " ";
        }
        cout << endl;
    }

    return 0;
}