EN
Java - get all possible combinations of 2D array (each sub-array can have different size)
5 points
Quick solution:
xxxxxxxxxx1
public class CombinationsUtil {2
3
public static void printCombinations(int[][] mx, int position, String result) {4
if (position == mx.length) {5
System.out.println(result.substring(2));6
return;7
}8
for (int i = 0; i < mx[position].length; i++) {9
String newResult = result + ", " + mx[position][i];10
printCombinations(mx, position + 1, newResult);11
}12
}13
14
public static void main(String[] args) {15
int[][] mx = {16
{10, 20},17
{30, 40, 50}18
};19
printCombinations(mx, 0, "");20
}21
}Result:
xxxxxxxxxx1
10, 302
10, 403
10, 504
20, 305
20, 406
20, 50Example 2
xxxxxxxxxx1
public class CombinationsUtilTest2 {2
3
public static void main(String[] args) {4
int[][] mx = {5
{10, 20, 30},6
{40, 50},7
{70, 80, 90}8
};9
CombinationsUtil.printCombinations(mx, 0, "");10
}11
}Result:
xxxxxxxxxx1
10, 40, 702
10, 40, 803
10, 40, 904
10, 50, 705
10, 50, 806
10, 50, 907
20, 40, 708
20, 40, 809
20, 40, 9010
20, 50, 7011
20, 50, 8012
20, 50, 9013
30, 40, 7014
30, 40, 8015
30, 40, 9016
30, 50, 7017
30, 50, 8018
30, 50, 90
