0-9選6個數(shù)加起來等于33的排列組合,數(shù)字可以重復。
2 回答
慕萊塢森
TA貢獻1810條經(jīng)驗 獲得超4個贊
簡單粗暴的排列算法：
public class BruteForceArrangement {
public static void main(String[] args) {
for (int a = 0; a < 10; a++)
for (int b = 0; b < 10; b++)
for (int c = 0; c < 10; c++)
for (int d = 0; d < 10; d++)
for (int e = 0; e < 10; e++)
for (int f = 0; f < 10; f++)
if (a + b + c + d + e + f == 33)
System.out.printf("%d%d%d%d%d%d\n", a, b, c, d, e, f);
}
}
簡單粗暴的組合算法：
public class BruteForceCombination {
public static void main(String[] args) {
for (int a = 0; a < 10; a++)
for (int b = a; b < 10; b++)
for (int c = b; c < 10; c++)
for (int d = c; d < 10; d++)
for (int e = d; e < 10; e++)
for (int f = e; f < 10; f++)
if (a + b + c + d + e + f == 33)
System.out.printf("%d%d%d%d%d%d\n", a, b, c, d, e, f);
}
}
添加回答
舉報
0/150
提交
取消