/**
* origami problem
* @param n
*/
public static void printAllFolds(int n) {
process(true,1,n);
System.out.println();
}
/**
* base on middle traversal
*/
public static void process(boolean concaveOrRaised,int curIndex,int n){
if(curIndex > n){
return;
}
process(true,curIndex + 1,n);
System.out.print(concaveOrRaised ? " concave " : " raised " );
process(false,curIndex + 1,n);
}
二叉树折纸问题
最新推荐文章于 2024-07-20 23:55:03 发布