ArraysOfPractice

package practiceofcsp;

import java.util.Arrays;
import java.util.Comparator;
import java.util.Random;
import java.util.Scanner;

public class UseExampleForArrays {
        public static void main(String[] args) {
        	int m,n;
        	System.out.println("please enter m and n");
        	Scanner reader=new Scanner(System.in);
        	m=reader.nextInt();
        	n=reader.nextInt();
        	Random r=new Random(m);
        	Student1[] s1=new Student1[n];
        	for(int i=0;i<n;i++) {
        		s1[i]=new Student1();
        		s1[i].id=i+1;
        		s1[i].grad1=r.nextInt(101);
        		s1[i].grad2=r.nextInt(101);
        		s1[i].grad3=r.nextInt(101);
        		s1[i].sum=s1[i].grad1+s1[i].grad2+s1[i].grad3;
        }
        	Arrays.sort(s1);
        	System.out.println("Comparable接口实现的排序:");
        	for(int i=0;i<s1.length;i++) {
        		System.out.printf("%5d%5d%5d%5d%5d\n",s1[i].id,s1[i].grad1,s1[i].grad2,s1[i].grad3,s1[i].sum);
        	}
        	Student2[] s=new Student2[n];
            for(int i = 0; i < n; i++){
                s[i] = new Student2();
                s[i].id = i+1;
                s[i].grad1 = r.nextInt(101);
                s[i].grad2 = r.nextInt(101);
                s[i].grad3 = r.nextInt(101);
                s[i].sum = s[i].grad1+s[i].grad2+s[i].grad3;
            }
            Arrays.sort(s, new Student2());
            System.out.println("Comparator接口实现的排序:");
            for (int i = 0; i < s.length; i++){
                System.out.printf("%5d%5d%5d%5d%5d\n",s[i].id,s[i].grad1,s[i].grad2,s[i].grad3,s[i].sum);
            }

        	
}
}
class Student1 implements Comparable<Student1>{
	public int id,grad1,grad2,grad3,sum;
	@Override
	public int compareTo(Student1 o) {
		// TODO Auto-generated method stub
		if(this.sum>o.sum) {
			return 1;
		}
		else if(this.sum<o.sum) {
			return -1;
		}
		else {
			return 0;
		}
	}
}
class Student2 implements Comparator<Student2>{
   public int id,grad1,grad2,grad3,sum;
	@Override
	public int compare(Student2 o1, Student2 o2) {
		// TODO Auto-generated method stub
		return o1.sum-o2.sum;
	}
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值