解析:这道题不难,可我做起来麻烦,因为经常要转换变量类型,就很头疼,这方面我不是很熟练。思路是这样的,获取输入的数,存为字符型,然后遍历一遍存进数组里,数组的升降序排序大家应该都会把,这样就简单了,然后排序后的数组分别存进俩个变量,方便计算我们要把数组转成int型,这就需要我们会点正则表达式,我就是死记,"\\[|\\]|,|\\s"替换成""。然后这俩个数组的差作为判断进行while处理。还有注意格式要四位的占位,也就是"%04d"。
public class Pta_1019 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String num = scanner.nextLine();
int[] arr = new int[4];
int num1 = 0;
int num2 = 0;
int res = 0;
for (int i = 0; i < num.length(); i++) {
arr[i] = num.charAt(i) - 48;
}
while (true) {
Arrays.sort(arr);//升序
num1 = Integer.parseInt(Arrays.toString(arr).replaceAll("\\[|\\]|,|\\s",""));
num2 = Integer.parseInt(Arrays.toString(jiangxu(arr)).replaceAll("\\[|\\]|,|\\s",""));
res = num2 - num1;
if (res==0) {
System.out.printf("%04d - %04d = %04d\n", num2,num1,res);
break;
}
if(res==6174){
System.out.printf("%04d - %04d = %04d\n", num2,num1,res);
break;
}
System.out.printf("%04d - %04d = %04d\n", num2,num1,res);
String ress= String.valueOf(res);
for(int i=0;i<ress.length();i++){
arr[i]=ress.charAt(i)-48;
}
}
}
//降序
static int[] jiangxu(int[] arr) {
int temp;
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length - i - 1; j++) {
if (arr[j] < arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
return arr;
}
}