package practise;
//将数组降序排列
import java.util.Arrays;
public class Exe01 {
public static void main(String[] args) {
int[] ns = { 28, 12, 89, 73, 65, 18, 96, 50, 8, 36 };
// 排序前:
System.out.println(Arrays.toString(ns));
Arrays.sort(ns);
int[] ms=new int[ns.length];
for(int i=0;i<ns.length;i++) {
ms[ns.length-i-1]=ns[i];
}
// 排序后:
System.out.println(Arrays.toString(ms));
if (Arrays.toString(ms).equals("[96, 89, 73, 65, 50, 36, 28, 18, 12, 8]")) {
System.out.println("测试成功");
} else {
System.out.println("测试失败");
Sign in to make a reply
江湖大侠叶开花
package practise;
//将数组降序排列
import java.util.Arrays;
public class Exe01 {
public static void main(String[] args) {
int[] ns = { 28, 12, 89, 73, 65, 18, 96, 50, 8, 36 };
// 排序前:
System.out.println(Arrays.toString(ns));
Arrays.sort(ns);
System.out.println(Arrays.toString(ns));
int[] ms=new int[ns.length];
for(int i=0;i<ns.length;i++) {
ms[ns.length-i-1]=ns[i];
}
// 排序后:
System.out.println(Arrays.toString(ms));
if (Arrays.toString(ms).equals("[96, 89, 73, 65, 50, 36, 28, 18, 12, 8]")) {
System.out.println("测试成功");
} else {
System.out.println("测试失败");
}
}
}