通过递归求出二维vector每一维vector中取一个数的各种组合
输入:[[a], [b1, b2], [c1, c2, c3]]
输出:[a_b1_c1, a_b1_c2, a_b1_c3, a_b2_c1, a_b2_c2, a_b2_c3]
vector<string> combination(vector<vector<string> > &dimensionalArr){
int FLength = dimensionalArr.size();
if(FLength >= 2){
int SLength1 = dimensionalArr[0].size();
int SLength2 = dimensionalArr[1].size();
int DLength = SLength1 * SLength2;
vector<string> temporary(DLength);
int index = 0;
for(int i = 0; i < SLength1; i++){
for (int j = 0; j < SLength2; j++) {
temporary[index] = dimensionalArr[0][i] +"_"+ dimensionalArr[1][j];
index++;
}
}
vector<vector<string> > new_arr;
new_arr.push_back(temporary);
for(int i = 2; i < (int)dimensionalArr.size(); i++){
new_a