解题思路:
注意事项:不用排序,题目说要排序坑死了
参考代码:
public class 排列 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner in = new Scanner(System.in); while (in.hasNext()) { int N = in.nextInt(); while (N != 0) { int[] nums = new int[4]; for (int i = 0; i < nums.length; i++) { nums[i] = in.nextInt(); } int[][] numsprintf = new int[4][6]; int q = 0; for (int i = 0; i < nums.length; i++) { int w = 0; for (int j = 0; j < nums.length; j++) { if (nums[j] != nums[i]) { for (int k = 0; k < nums.length; k++) { if (nums[k] != nums[j] && nums[k] != nums[i]) { for (int z = 0; z < nums.length; z++) { if (nums[z] != nums[j] && nums[z] != nums[i] && nums[z] != nums[k]) { numsprintf[q][w++] = (int) (Math.pow(10, 3) * nums[i] + Math.pow(10, 2) * nums[j] + Math.pow(10, 1) * nums[k] + Math.pow(10, 0) * nums[z]); } } } } } } q++; } for (int i = 0; i < numsprintf.length; i++) { for (int j = 0; j < numsprintf[i].length; j++) { if (j == numsprintf[i].length - 1) { System.out.print(numsprintf[i][j]); } else { System.out.print(numsprintf[i][j] + " "); } } if (i != numsprintf.length - 1) System.out.println(); } if (N != 1) { System.out.println("\n"); } else { System.out.println(); } N--; } } } }
0.0分
0 人评分