请关注 http://topic.csdn.net/u/20080624/11/55e5a350-d260-4a35-a02a-71b4c1795a00.html 或使用 2 楼的方法 或使用: import java.util.Scanner; import java.util.Arrays;public class ArrayDesc { public static void main(String[] args) { Scanner inputer = new Scanner(System.in); int[] nums = new int[5]; for (int i = 0; i < nums.length; i++) { nums[i] = inputer.nextInt(); } Arrays.sort(nums); for (int i = nums.length - 1; i >= 0; i--) { System.out.print(nums[i] + " "); } } }
我的效率肯定比2楼的高,用我的,然后90分给我,10分给他,自己比较吧 import java.util.*;public class csdntest3{ @SuppressWarnings("unchecked") public static void main(String[] args){ List<Integer> list = new ArrayList<Integer>(); for(int i = 1; i <=5; i++){ list.add(i); }
Collections.sort(list, new Comparatorsort()); for(int i = 0; i < list.size(); i++){ System.out.println(list.get(i)); } } }class Comparatorsort implements Comparator{ public int compare(Object o1,Object o2) { Integer str1=(Integer)o1; Integer str2=(Integer)o2; if(str1.compareTo(str2)>0) return -1; if(str1.compareTo(str2)<0) return 1; return 0; } }
import java.util.*; class JiangXu implements Comparator<Integer>{ //Implement the compare() method so that it //reverses the order of the integer comparison. public int compare(Integer A,Integer B){ return B.compareTo(A); //return A-B; //return 0; } }
public class PaiXu2 { public static void main(String[] args) { new PaiXu2().zou(); } public void zou() { Integer ZhengShu[] = {2,5,7,8,6,3,18,6}; JiangXu FanGuoLai=new JiangXu();
Arrays.sort(ZhengShu,FanGuoLai); for(int i = 0; i < ZhengShu.length; i++) { System.out.println(ZhengShu[i]); } } }
楼主【jay135787700】截止到2008-06-25 01:42:19的历史汇总数据(不包括此帖):
发帖数:3 发帖分:70
结贴数:3 结贴分:70
未结数:0 未结分:0
结贴率:100.00% 结分率:100.00%
敬礼!
import java.util.Scanner;public class Sort{
public static void main(String[] args)
{
int[] nums = new int[5];//声明一个长度为5的数组,用来存放输入的数字
Scanner sc = new Scanner(System.in);//创建一个Scanner对象,从系统标准输入读取数据
for (int i = 0; i < nums.length; i++)
{
System.out.println("请输入第 "+(i+1)+"个整数:");
nums[i] = sc.nextInt();//从控制台读取一个整数,循环5次,读取5个
}
sc.close();
//以下是排序代码
for (int i = 0; i < nums.length; i++)
{
for (int j = i+1; j < nums.length; j++)
{
if ( nums[i] < nums[j])
{
int tmp = nums[i];
nums[i] = nums[j];
nums[j] = tmp;
}
}
}
//下面讲所有的数打印出来
for (int i = 0; i < nums.length; i++)
{
System.out.println(nums[i]);
}
}
}
http://topic.csdn.net/u/20080624/11/55e5a350-d260-4a35-a02a-71b4c1795a00.html
或使用 2 楼的方法
或使用:
import java.util.Scanner;
import java.util.Arrays;public class ArrayDesc { public static void main(String[] args) {
Scanner inputer = new Scanner(System.in);
int[] nums = new int[5];
for (int i = 0; i < nums.length; i++) {
nums[i] = inputer.nextInt();
}
Arrays.sort(nums);
for (int i = nums.length - 1; i >= 0; i--) {
System.out.print(nums[i] + " ");
}
}
}
import java.util.*;public class csdntest3{
@SuppressWarnings("unchecked")
public static void main(String[] args){
List<Integer> list = new ArrayList<Integer>();
for(int i = 1; i <=5; i++){
list.add(i);
}
Collections.sort(list, new Comparatorsort());
for(int i = 0; i < list.size(); i++){
System.out.println(list.get(i));
}
}
}class Comparatorsort implements Comparator{
public int compare(Object o1,Object o2)
{
Integer str1=(Integer)o1;
Integer str2=(Integer)o2;
if(str1.compareTo(str2)>0)
return -1;
if(str1.compareTo(str2)<0)
return 1;
return 0;
}
}
//Implement the compare() method so that it
//reverses the order of the integer comparison.
public int compare(Integer A,Integer B){
return B.compareTo(A);
//return A-B;
//return 0;
}
}
public class PaiXu2
{
public static void main(String[] args)
{
new PaiXu2().zou();
}
public void zou()
{
Integer ZhengShu[] = {2,5,7,8,6,3,18,6};
JiangXu FanGuoLai=new JiangXu();
Arrays.sort(ZhengShu,FanGuoLai);
for(int i = 0; i < ZhengShu.length; i++)
{
System.out.println(ZhengShu[i]);
}
}
}
http://www.blueidea.com/tech/program/2004/2344.asp