0
我不得不產生矩陣0的所有可能的組合和1 ..我愛:如何產生的1024×10矩陣0的組合和1
0000000000, 0000000001, 0000000010, 0000000011.... etc.
有沒有更好的方式來做到這一點而不是使用如下所示的嵌套for循環?
class Reliability {
// Trying to create combinations of 0 and 1s
public static void main(String[] args) {
// Creating an array of size 1024X10
int connectMat[][] = new int[1024][10];
int count1 = 0;
// Intitially all rows are set to zero
for (int r1 = 0; r1 <= 1; r1++) {
// fill all rows with 0 and the 1
for (int r2 = 0; r2 <= 1; r2++) {
for (int r3 = 0; r3 <= 1; r3++) {
for (int r4 = 0; r4 <= 1; r4++) {
// Updating the elements of each row
connectMat[count1][0] = r1;
connectMat[count1][1] = r2;
connectMat[count1][2] = r3;
connectMat[count1][3] = r4;
// Incrementing count to point to the next row
count1++;
}
}
}
}
你認爲什麼是「組合」? – Mordechai
您是否需要「查找」或「生成」組合( - 無論您對「組合」這個詞是什麼意思)? – Mordechai
我需要生成組合 – Connors