解题思路:
注意事项:
参考代码:
public class 数列排序 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner in = new Scanner(System.in); int N = in.nextInt(); while (N != 0) { int[] nums = new int[9]; int[] qianmian = new int[9]; int[] houmian = new int[9]; int j = qianmian.length - 1; int k = 0; for (int i = 0; i < nums.length; i++) { nums[i] = in.nextInt(); if (nums[i] < nums[0]) { qianmian[j--] = nums[i]; } if (nums[i] > nums[0]) { houmian[k++] = nums[i]; } } for(int i=j+1;i<qianmian.length;i++) { System.out.print(qianmian[i]+" "); } System.out.print(nums[0]+" "); for(int i=0;i<k;i++) { System.out.print(houmian[i]+" "); } System.out.println(); N--; } } }
0.0分
1 人评分