蓝桥杯算法提高VIP-排列式 （Java代码）

解题思路:

注意事项:

参考代码:

import java.util.Arrays;

import java.util.Comparator;

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

Scanner input = new Scanner(System.in);

Integer a[][]=new Integer[10][3];

int k=0;

for (int i =1; i <=48; i++) {

for (int j = 1; j<=2000; j++) {

int m=i*j;

String str=m+""+i+""+j;

if(fun(str)){

a[k][0]=m;

a[k][1]=i;

a[k++][2]=j;

}

}

}

Arrays.sort(a,0,k,new Comparator<Integer[]>(){

@Override

public int compare(Integer[] a, Integer[] b) {

if(a[0]>b[0])return 1;

else if(a[0]<b[0])return -1;

else{

if(a[1]>b[1])return 1;

else if(a[1]<b[1])return -1;

else return 0;

}

}

});

for (int i = 0; i < a.length-1; i++) {

System.out.println(a[i][0]+" = "+a[i][1]+" x "+a[i][2]);

}

}

private static boolean fun(String str) {

if(str.contains("1")&&str.contains("2")&&str.contains("3")&&str.contains("4")&&str.contains("5")&&str.contains("6")&&str.contains("7")

&&str.contains("8")&&str.contains("9")&&str.length()==9)return true;

return false;

}

}