方法一:
int[] ns = {28, 12, 89, 73, 65, 18, 96, 50, 8, 36}; Arrays.sort(ns); //把ns顺序排列 int[] ms = new int[ns.length]; int j = 0; for (int i = ns.length - 1; i > -1; i--) //把ns从尾到头,依次赋值给ms,形成倒序。 { ms[j] = ns[i]; j++; } System.out.println(Arrays.toString(ms)); //要用ms输出
方法二
for (int i = 0; i < ns.length - 1; i++) { for (int j = 0; j < ns.length - 1 - i; j++) { int mid = 0; if (ns[j] < ns[j + 1]) { mid = ns[j]; ns[j] = ns[j + 1]; ns[j + 1] = mid; } } }
Sign in to make a reply
康208970
方法一:
int[] ns = {28, 12, 89, 73, 65, 18, 96, 50, 8, 36};
Arrays.sort(ns); //把ns顺序排列
int[] ms = new int[ns.length];
int j = 0;
for (int i = ns.length - 1; i > -1; i--) //把ns从尾到头,依次赋值给ms,形成倒序。
{
ms[j] = ns[i];
j++;
}
System.out.println(Arrays.toString(ms)); //要用ms输出
方法二
for (int i = 0; i < ns.length - 1; i++) {
for (int j = 0; j < ns.length - 1 - i; j++) {
int mid = 0;
if (ns[j] < ns[j + 1]) {
mid = ns[j];
ns[j] = ns[j + 1];
ns[j + 1] = mid;
}
}
}