public class HeiDong {
static Scanner Input = new Scanner(System.in);
static int shu = Input.nextInt();
public static int[] paixu(int[] px){
int[] a =new int[4];
for(int i =0;i < a.length;i ++){
a[i] = (int)(shu /Math.pow(10, a.length-i-1));
shu %= Math.pow(10, a.length-i-1);
}
System.out.println(Arrays.toString(a));
return a;
}
public static int min(int min){
int[] a = new int[4];
a = paixu(a);
Arrays.sort(a, 0, 4);
System.out.print(Arrays.toString(a));
for(int i= 0;i < a.length;i ++){
min += (int)(a[i]*Math.pow(10, a.length-i-1));
}
System.out.println(min);
return min;
}
public static int max(int max){
int[] a = new int[4];
a = paixu(a);
for(int i =0;i < a.length-1;i ++){
for(int j = i +1;j < a.length;j ++){
if(a[i]
a[i] = a[j];
a[j] = tmp;
}
}
}
System.out.print(Arrays.toString(a));
for(int i= 0;i < a.length;i ++){
max += (int)(a[i]*Math.pow(10, a.length-i-1));
}
System.out.println(max);
return max;
}
public static void main(String agr[]){
int a =0;
min(a);
max(a);
}
}
运行结果：
1234
[1, 2, 3, 4]
[1, 2, 3, 4]1234
[0, 0, 0, 0]
[0, 0, 0, 0]0