打印3D向量的所有组合

时间:2018-12-04 16:37:46

标签: c++ vector combinations

假设我有一个vector<vector<vector<int> > > result

我唯一知道的大小是内部和外部向量,大小为k

如果我打印result,我会得到这个(对于k = 3):

i = 0

0 1 2
3 4 5

i = 1

6 7 8
9 10 11
12 13 14

i = 2

15 16 17
18 19 20

我需要做的是从k的向量的每个向量中打印i行的每个组合。换句话说,我需要的是以下输出:

0 1 2
6 7 8
15 16 17

0 1 2
6 7 8
18 19 20

0 1 2
9 10 11
15 16 17

...

3 4 5
12 13 14
18 19 20

希望我很清楚期望的输出。我尝试了上千种不同的循环,试图保存在另一个vector<vector<int> >中,但到目前为止没有成功。我真的迷路了,将不胜感激。

生成上述输出的代码在这里:

(很抱歉,我知道这是一个丑陋的代码,但这是我可以在MCVE代码中证明我的问题的最接近的代码)

#include <iostream>
#include <vector>
using namespace std;

int main(){
    vector<vector<vector<int> > > result;
    int k = 3;
    vector<vector<int> > randomVectors;
    //I'll create seven random vectors
    //In my original problem, I don't have this number beforehand
    int number = 0;
    for(int i = 0; i < 7; i++){
        vector<int> temp;
        for(int j = 0; j < k; j++){
            temp.push_back(number);
            number++;
        }
        randomVectors.push_back(temp);
    }
    //Vector of vector to assign to "result"
    vector<vector<int> > randomVectors_0;
    randomVectors_0.push_back(randomVectors[0]);
    randomVectors_0.push_back(randomVectors[1]);
    vector<vector<int> > randomVectors_1;
    randomVectors_1.push_back(randomVectors[2]);
    randomVectors_1.push_back(randomVectors[3]);
    randomVectors_1.push_back(randomVectors[4]);
    vector<vector<int> > randomVectors_2;
    randomVectors_2.push_back(randomVectors[5]);
    randomVectors_2.push_back(randomVectors[6]);

    result.push_back(randomVectors_0);
    result.push_back(randomVectors_1);
    result.push_back(randomVectors_2);

    cout << "Printing the 3D vector" << endl;
    for(int i = 0; i < k; i++){
        cout << "i = " << i << endl << endl;
        for(int j = 0; j < result[i].size(); j++){
            for(int m = 0; m < k; m++){
                cout << result[i][j][m] << " ";
            }
            cout << endl;
        }
        cout << endl;
    }
    return 0;
}

编译器版本:gcc(tdm-1)4.7.1

1 个答案:

答案 0 :(得分:1)

我将创建一个{0}开头的rows_to_print向量。然后,一旦循环,它将最后一个值加1。如果该值大于最后一个向量的大小,则将其重置为0,并在列表中增加下一个值,依此类推...完成当rows_to_print中的每个值大于每个向量的大小时循环:

void print_rows(std::vector<size_t> rows, std::vector<std::vector<std::vector<int>>> v) {
    for(size_t x = 0; x < v.size(); x++) {
        for(size_t y = 0; y < v.at(x).at(rows.at(x)).size(); y++) {
            std::cout << v.at(x).at(rows.at(x)).at(y) << ' ';
        }
        std::cout << std::endl;
    }
}

bool increment_rows(std::vector<size_t> &rows, std::vector<std::vector<std::vector<int>>> v) {
    if(!rows.size()) return false; //empty rows, BAD
    rows.at(rows.size() - 1)++;
    for(int x = rows.size() - 1; x >= 0; x--) {
        if(rows.at(x) >= v.at(x).size()) {
            if(x <= 0) { return false; } //first row is done, then we're done!
            rows.at(x-1)++; //increment previous row and set us back to 0 (overflow)
            rows.at(x) %= v.at(x).size();
        }
    }
    return true;
}


int main() {
    ...

    std::vector<size_t> rows_to_print(k, 0);
    print_rows(rows_to_print, result);
    while(increment_rows(rows_to_print, result)) {
        print_rows(rows_to_print, result);
    }
}

在此处查看实际操作:ideone

相关问题