import java.util.Arrays;
public class HelloWorld
{
public static void main(String[] args)
int[] ns = { 28, 12, 89, 73, 65, 18, 96, 50, 8, 36 };
int[] new_arr = rsort(ns);
System.out.println(Arrays.toString(new_arr));
}
//数组降序
public static int[] rsort(int[] ns)
int tmp = 0;
for(int i=0; i<ns.length;i++)
for(int j=0;j<ns.length-1;j++)
if(ns[j] < ns[j+1])
tmp = ns[j];
ns[j] = ns[j+1];
ns[j+1] = tmp;
return ns;
Sign in to make a reply
刘晋呈php
import java.util.Arrays;
public class HelloWorld
{
public static void main(String[] args)
{
int[] ns = { 28, 12, 89, 73, 65, 18, 96, 50, 8, 36 };
int[] new_arr = rsort(ns);
System.out.println(Arrays.toString(new_arr));
}
//数组降序
public static int[] rsort(int[] ns)
{
int tmp = 0;
for(int i=0; i<ns.length;i++)
{
for(int j=0;j<ns.length-1;j++)
{
if(ns[j] < ns[j+1])
{
tmp = ns[j];
ns[j] = ns[j+1];
ns[j+1] = tmp;
}
}
}
return ns;
}
}