吸血鬼数字
吸血鬼数字
Code
package csdn.kao331431214.code;
public class Vampire {
public static void main(String[] arg){
String[] x, y;
int sum = 0;
//双重循环穷举
for(int i = 10;i < 100; i++){
//j=i+1避免重复
for(int j = i + 1;j < 100;j++){
int num = i * j;
if(num < 1000 || num > 9999)
continue;//积小于1000或大于9999排除,继续下一轮环
x = String.valueOf(num).split("");
y = (String.valueOf(i) + String.valueOf(j)).split("");
java.util.Arrays.sort(x);
java.util.Arrays.sort(y);
if(java.util.Arrays.equals(x, y)){//排序后比较,为真则找到一组
sum++;
System.out.println("第"
+ sum + "组: " + i + "*" + j + "=" + num);
}
}
}
System.out.println("共找到"+sum+"组吸血鬼数");
}
}
package csdn.kao331431214.code;
public class Vampire {
public static void main(String[] arg){
String[] x, y;
int sum = 0;
//双重循环穷举
for(int i = 10;i < 100; i++){
//j=i+1避免重复
for(int j = i + 1;j < 100;j++){
int num = i * j;
if(num < 1000 || num > 9999)
continue;//积小于1000或大于9999排除,继续下一轮环
x = String.valueOf(num).split("");
y = (String.valueOf(i) + String.valueOf(j)).split("");
java.util.Arrays.sort(x);
java.util.Arrays.sort(y);
if(java.util.Arrays.equals(x, y)){//排序后比较,为真则找到一组
sum++;
System.out.println("第"
+ sum + "组: " + i + "*" + j + "=" + num);
}
}
}
System.out.println("共找到"+sum+"组吸血鬼数");
}
}
编程路漫漫其修远兮,吾将上下而求索;
看我破茧而出,化身为龙\(^o^)/