java验证卡布列克常数

/*
 * java验证卡布列克常数
 */
package test1;


import java.util.Scanner;


public class demo {
public static void main(String[] args)
{
Scanner in=new Scanner(System.in);
System.out.print("请输入一个数：");
int num = in.nextInt();
KaBuLieKe(num);
}
public static void KaBuLieKe(int n)
{
int count = 0;
int cha = 0;
while(cha!=6174)
{
cha=getTheMaxOrMin(n,1)-getTheMaxOrMin(n,0);
System.out.println(count +":"+getTheMaxOrMin(n,1) + 
"-" + getTheMaxOrMin(n,0) + "=" + cha);
n=cha;
count++;
}
System.out.println("验证通过！");
}
public static int getTheMaxOrMin(int n,int MaxOrMin)
{
if(n<1000 || n>9999)
return -1;
int a = getThe(n,4);
int b = getThe(n,3);
int c = getThe(n,2);
int d = getThe(n,1);
int temp = 0;
int[] list = new int[]{a,b,c,d};
for(int i=0;i<4;i++)
{
for(int j=i;j<4;j++)
{
if(MaxOrMin==1?(list[i]<list[j]):(list[i]>list[j]));
{
temp=list[i];
list[i]=list[j];
list[j]=temp;
}
}
}
return list[0]*1000+list[1]*100+list[2]*10+list[3];
}
public static int getThe(int num,int i)
{
if(i>getBitCount(num) || i<1)
return -1;
else
{
return (num%((int)Math.pow(10, i)))/(int) Math.pow(10, i-1);
}
}
public static int getBitCount(int n)
{
int i = 1;
while(n/10 >0)
{
i++;
n/=10;
}
return i;
}
}