问题描述
搭积木
小明最近喜欢搭数字积木,
一共有10块积木,每个积木上有一个数字,0~9。
搭积木规则:
每个积木放到其它两个积木的上面,并且一定比下面的两个积木数字小。
最后搭成4层的金字塔形,必须用完所有的积木。
下面是两种合格的搭法:
0
1 2
3 4 5
6 7 8 9
0
3 1
7 5 2
9 8 6 4
请你计算这样的搭法一共有多少种?
请填表示总数目的数字。
注意:你提交的应该是一个整数,不要填写任何多余的内容或说明性文字。
代码实现
这里打印了每一个积木搭建方法,如果只是做题可以省去。
代码来源:李先森Boot
public static void main(String[] args) {
solution();
}
public static void solution(){
List<String> allArrayList = getAllQueue("123456789");
List<String> enableList = new ArrayList<String>();
for (String element : allArrayList){
if (isCorrentAnswer(element)){
enableList.add(element);
}
}
//循环打印积木搭建
for (int i = 0; i < enableList.size(); i++) {
String element = enableList.get(i);
System.out.println("答案" + (i+1) + ": ");
printPyramid(element);
}
System.out.println("共计:"+enableList.size());
}
//打印积木搭建
public static void printPyramid(String element){
char[] chars = element.toCharArray();
System.out.println(" 0");
System.out.println(" " + chars[0] + " " + chars[1]);
System.out.println(" " + chars[2] + " " + chars[3] + " " + chars[4]);
System.out.println(chars[5] + " " + chars[6] + " " + chars[7] + " " + chars[8]);
System.out.println();
}
public static boolean isCorrentAnswer(String sequence){
char[] charArray = sequence.toCharArray();
int[] numArray = new int[charArray.length];
for (int i = 0; i < charArray.length; i++) {
numArray[i] = Integer.parseInt(String.valueOf(charArray[i]));
}
//判断是否满足条件
boolean flag1 = numArray[0] < numArray[2] && numArray[2] < numArray[5];
boolean flag2 = numArray[1] < numArray[3] && numArray[3] < numArray[6];
boolean flag3 = numArray[4] < numArray[7];
boolean flag4 = numArray[1] < numArray[4] && numArray[4] < numArray[8];
boolean flag5 = numArray[0] < numArray[3] && numArray[3] < numArray[7];
boolean flag6 = numArray[2] < numArray[6];
return flag1 && flag2 && flag3 && flag4 && flag5 && flag6;
}
public static List<String> getAllQueue(String content){
List<String> result = new ArrayList<String>();
for (int i = 0; i < content.length(); i++) {
result = insertChar(result, content.charAt(i));
}
return result;
}
public static List<String> insertChar(List<String> srcList, char a){
if (srcList.size() == 0){
srcList.add(String.valueOf(a));
return srcList;
}
List<String> resultList = new ArrayList<String>();
for (String element : srcList){
for (int pos = 0; pos <= element.length(); pos ++){
String prefix = element.substring(0, pos);
String suffix = element.substring(pos);
String result = prefix + a + suffix;
resultList.add(result);
}
}
return resultList;
}