笛卡尔积算法实现-递归

static int[] a = {1, 2, 3, 4}; static int[] b = {5, 6}; static int[] c = {7, 8}; static int[][] d = {a, b, c}; static int[] data = new int[d.length]; public static void main(Strin

>>阅读原文<<