java结构体排序

版权声明：2018/4/10重启blog；转载请注明出处 https://blog.csdn.net/zhaiqiming2010/article/details/88174965

package aaa;

import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
class number implements Comparable<number>{
	
	int a;

	public int compareTo(number o) {
		if(this.a-o.a != 0)
		return this.a-o.a;
		else return 0;
	}
}
public class Main {
	
	public static void main(String args[]) {
		number nu[] = new number[10000+19];
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		for(int i = 0 ; i < n ; i++) {
			nu[i] = new number();
			Integer temp = scan.nextInt();
			nu[i].a = temp;
		}
		Arrays.sort(nu,0,n);
		for(int i = 0 ; i < n ; i++) {
			if(i==0)
			System.out.print(nu[i].a);
			else 
			System.out.print(" " + nu[i].a);
		}
	}
}