数字黑洞

来源：互联网发布：暗黑3 网络延迟编辑：程序博客网时间：2024/05/16 19:52
/** * 给定任一个各位数字不完全相同的4位正整数，如果我们先把4个数字按非递增排序，再按非递减排序， * 然后用第1个数字减第2个数字，将得到一个新的数字。一直重复这样做，我们很快会停在有“数字黑洞” * 之称的6174，这个神奇的数字也叫Kaprekar常数。例如，我们从6767开始，将得到7766 - 6677 = 10899810 - 0189 = 96219621 - 1269 = 83528532 - 2358 = 61747641 - 1467 = 6174... ...现给定任意4位正整数，请编写程序演示到达黑洞的过程 * @author Q * */import java.util.Scanner;public class Main {static int z = 0;static String mm = "";//相减之后的数static int x = 0, y = 0;//计算排序后的数public static void main(String[] args) {Scanner sc = new Scanner(System.in);String m = sc.next();int n = m.length();if(n == 1){m = "000"+m;}else if(n==2){m = "00"+m;}else if(n == 3){m = "0"+m;}cha(m);}//计算函数static int cha(String m) {while (z != 6174) {char[] ch = m.toCharArray();int[] in = new int[4];for (int i = 0; i < 4; i++) {in[i] = ch[i] - 48;}//排序for (int i = 0; i < 3; i++) {for (int j = 0; j < 3 - i; j++) {if (in[j] < in[j + 1]) {int temp = in[j];in[j] = in[j + 1];in[j + 1] = temp;}}}for (int i = 0; i < 4; i++) {x = x * 10 + in[i];y = y * 10 + in[3 - i];}if(x == y){for (int i = 0; i < 4; i++) {System.out.print(in[i]);}System.out.print(" "+"-"+" ");for (int i = 0; i < 4; i++) {System.out.print(in[3-i]);}System.out.print(" "+"="+" "+"0000");}else if (z != 6174) {for (int i = 0; i < 4; i++) {System.out.print(in[i]);}System.out.print(" "+"-"+" ");for (int i = 0; i < 4; i++) {System.out.print(in[3-i]);}System.out.print(" "+"="+" ");z = x - y;if(z<1000){mm = "0"+z+"";System.out.println("0"+z);}else{System.out.println(z);mm = z+"";}cha(mm);}}return 0;}}
0 0