蓝桥杯任务之s01串

import java.util.Scanner;
public class Main {


public static void f(int n,StringBuffer s1){
if(n==0){
System.out.println(s1.toString());
return;
}
StringBuffer temp = new StringBuffer();
for(int i=0;i<s1.length();i++){
if(s1.charAt(i)=='0'){
temp.append("1");
}else if(s1.charAt(i)=='1'){
temp.append("01");
}

}
f(n-1,temp);
}


public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner input = new Scanner(System.in);
int n = input.nextInt();
StringBuffer s1 = new StringBuffer("0");
f(n,s1);
}

}

这是从后往前推的递归。