文章标题

1.定义一个Employee类,属性:name:String,age:int,salary:double
把若干Employee对象放在List中,排序并遍历输出,排序规则:salary高的在前面,salary相同时age大的在前面,age也相同时按照name升序排列
把若干Employee对象放在Set中并遍历,要求没有重复元素

package com.oracle.collection2;

public class Employee {
private String name;
private int age;
private double salary;
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public double getSalary() {
return salary;
}
public void setSalary(double salary) {
this.salary = salary;
}
public Employee() {
super();
// TODO Auto-generated constructor stub
}
public Employee(String name, int age, double salary) {
super();
this.name = name;
this.age = age;
this.salary = salary;
}
@Override
public String toString() {
return “姓名” + name + “, 年龄” + age + “, 工资” + salary;
}

}

package com.oracle.collection2;

import java.util.ArrayList;
import java.util.List;

public class Test {

public static void main(String[] args) {
    Employee e1=new Employee("Java",13,3000);
    Employee e2=new Employee("PHP",13,4000);
    Employee e3=new Employee("CCC",22,5000);
    Employee e4=new Employee("Java",22,5000);
    Employee e5=new Employee("Java",44,5000);

    List<Employee> list=new ArrayList<Employee>();
    list.add(e1);
    list.add(e2);
    list.add(e3);
    list.add(e4);
    list.add(e5);

    for (Employee e : list) {
        System.out.println(e);
    }
    System.out.println("======排序 后====");
    //和冒泡排序相似
    for(int i=1;i<list.size();i++){
        for(int j=0;j<list.size()-i;j++){
            Employee emp1=list.get(j);
            Employee emp2=list.get(j+1);
            if(emp1.getSalary()<emp2.getSalary()){
                list.set(j, emp2);
                list.set(j+1,emp1);
            }else if(emp1.getSalary()<emp2.getSalary()){
                if(emp1.getAge() < emp2.getAge()){
                    list.set(j, emp2);
                    list.set(j+1,emp1);
                }else if(emp1.getAge() == emp2.getAge()){
                    if(emp1.getName().compareTo(emp2.getName()) >0){
                        list.set(j, emp2);
                        list.set(j+1,emp1);
                    }
                }


            }



        }


        }
    for (Employee employee : list) {
        System.out.println(employee);
    }


}

}

这里写图片描述

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值