数字黑洞题解.docVIP

/* To change this template, choose Tools | Templates and open the template in the editor. */ package javaapplication11; import java.util.ArrayList; import java.util.Arrays; import java.util.HashSet; import java.util.Iterator; import java.util.List; import java.util.Set; /**l** @authorxx */ public class BlackHole { public static void main(String[] args) { int[] array = new int[1000]; for (int i = 0; i 1000; i++) { array[i]=0;}ListInteger blackHoleList = new ArrayListInteger(); SetInteger hs=new HashSetInteger(); for (int i = 100; i 999; i++) { if(array[i]!=0) 1 / 4 continue; int n = i; while (array[n] == 0) { array[n]++; n = generateNextNum(n);}// 找到重复出现的数 ,此数有可能是黑洞 if(array[n] == 1){ while (array[n] 3 ) { array[n]++; if(!hs.contains(n)) hs.add(n); else blackHoleList.add(n); n = generateNextNum(n);}showResult(blackHoleList); blackHoleList.clear(); hs.clear();}} // for (int i = 100; i 999; i++) { // if(i%100==0) // System.out.println(); // System.out.print(array[i]); // }}// 生成下一个整数 n private static int generateNextNum(int n) { 2 / 4 int[] a = new int[5]; int[] asc = new int[5]; int[] desc = new int[5]; translateIntToArray(n, a); sortAll(a, asc, desc); int max = translateArrayToInt(desc); int min = translateArrayToInt(asc); n = max - min; return n;}private static void showResult(ListInteger blackHoleList) { if(blackHoleList.isEmpty()) return; System.out.print([); for (IteratorInteger it = blackHoleList.iterator(); it.hasNext();) {System.out.print(it.next()); if(it.hasNext()) System.out.print(,);}System.out.println(]);}// 把整数转化对应的整数数组 static void translateIntToArray(int n, int[] a) { int yushu; for (int i = a.length - 1; n 0; i--) { yushu = n % 10; a[i] = yushu; n = n / 10;}} 3 / 4 把整数数组转化成对应整数 static int translateArrayToInt(int[] a) { int n = 0; for (int i = 0; i a.length; i++) { n =n*10+ a[i];}return n;}// 排升序和降序 static void sortAll(int[] a, int[] asc, int[] desc) { System.arraycopy(a, 0, asc, 0, a.length); Arrays.sort(asc); System.arraycopy(asc, 0, desc, 0,