package ff;
public class maxn {
public static void main(String args[]){
printMax(3);
}
public static void printMax(int n){
if(n<=0)return;
str[i]=0;
str[0]=i;
rescursive(str,n,0);
}
}
static void rescursive(int[] str,int length,int index){
if(index==length-1){
print(str);
return;
}
for (int i = 0; i < 10; i++) {
str[index+1]=i;
rescursive(str, length, index+1);
}
// TODO Auto-generated method stub
int isbegin=1;
boolean flag=false;
int nlength=str.length;
for(int i=0;i<nlength;i++){
//System.out.print(isbegin&(int)(str[i]-'0'));
if(str[i]>0){
flag=true;
}
if(flag){
System.out.print(str[i]);
}
}
System.out.print(" ");
}
}
public class maxn {
public static void main(String args[]){
printMax(3);
}
public static void printMax(int n){
if(n<=0)return;
int[] str=new int[n];
//初始化为0
for (int i = 0; i < n; i++) {str[i]=0;
}
//利用循环来控制递归,设定递归出口为所有数位都设定好了数字。有点像3层的for循环,str[0]是百位,str[1]是十位,str[2]是个位。
for (int i = 0; i < 10; i++) {str[0]=i;
rescursive(str,n,0);
}
}
static void rescursive(int[] str,int length,int index){
if(index==length-1){
print(str);
return;
}
for (int i = 0; i < 10; i++) {
str[index+1]=i;
rescursive(str, length, index+1);
}
}
//输出结果,从百位开始看,找到第一个不为0的数,依次打印。这里没打印出0,可以改成if(str[i]>0|i==nlength-1)
private static void print(int[] str) {// TODO Auto-generated method stub
int isbegin=1;
boolean flag=false;
int nlength=str.length;
for(int i=0;i<nlength;i++){
//System.out.print(isbegin&(int)(str[i]-'0'));
if(str[i]>0){
flag=true;
}
if(flag){
System.out.print(str[i]);
}
}
System.out.print(" ");
}
}