创建一个Worker类,具有属性 name sex salary level 创建一个linkedlist作为容器.录入5条工人信息

创建一个Worker类,具有属性 name sex salary level

创建一个linkedlist作为容器,数据源定义在main方法中

写出一下方法:

1.录入5条工人信息

2.输出所有工人信息

3.根据工人的id通过匿名内部类进行排序,并且输出,要求工人的排序不影响源数据顺序

通过存放在一个新的arraylist中进行排序

4.所有男性工人的工资在原有基础上加200

5.通过使用listiterator修改所有工资超过5000的员工级别为H

package com.Work3;

import java.util.Objects;

/**
 * @Author: 廾匸
 * @Date: 2020/11/20 20:42
 * @Description: 工人类
 * @version: 1.01
 */
public class Worker {

    private String name;
    private char sex;
    private double salary;
    private char level;
    private int id;

    public Worker(String name, char sex, double salary, char level, int id) {
        this.name = name;
        this.sex = sex;
        this.salary = salary;
        this.level = level;
        this.id = id;
    }

    public int getId() {
        return id;
    }

    public void setId(int id) {
        this.id = id;
    }

    public Worker() {
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public char getSex() {
        return sex;
    }

    public void setSex(char sex) {
        this.sex = sex;
    }

    public double getSalary() {
        return salary;
    }

    public void setSalary(double salary) {
        this.salary = salary;
    }

    public char getLevel() {
        return level;
    }

    public void setLevel(char level) {
        this.level = level;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Worker worker = (Worker) o;
        return sex == worker.sex &&
                Double.compare(worker.salary, salary) == 0 &&
                level == worker.level &&
                id == worker.id &&
                Objects.equals(name, worker.name);
    }

    @Override
    public int hashCode() {
        return Objects.hash(name, sex, salary, level, id);
    }

    @Override
    public String toString() {
        return "Worker{" +
                "name='" + name + '\'' +
                ", sex=" + sex +
                ", salary=" + salary +
                ", level=" + level +
                ", id=" + id +
                '}';
    }
}




package com.Work3;

import java.util.*;

/**
 * @Author: 廾匸
 * @Date: 2020/11/20 20:46
 * @Description: 方法
 * @version: 1.01
 */
public class Methed {

    //添加
    public static void save(LinkedList<Worker> linkedList, Worker worker) {
        if (linkedList == null || worker == null) {
            return;
        }
        if(linkedList.size() != 0){
            for (Worker worker1 : linkedList) {
                if(worker1.getId() == worker.getId()){
                    System.out.println("id重复,请重新添加数据");
                }
            }
        }
        String name;
        char sex;
        double salary;
        char level;
        int id;
        for (int i = 0; i < 5; i++) {
            Scanner in = new Scanner(System.in);
            System.out.println("请输入姓名:");
            name = in.next();
            System.out.println("请输入性别:");
            sex = in.next().charAt(0);
            System.out.println("请输入工资:");
            salary = in.nextDouble();
            System.out.println("请输入级别:");
            level = in.next().charAt(0);
            System.out.println("请输入id::");
            id = in.nextInt();
            linkedList.add(new Worker(name, sex, salary, level,id));
        }
    }

    //输出
    public static void show(LinkedList<Worker> linkedList){
        for (Worker worker : linkedList) {
            System.out.println(worker);
        }
    }

    //排序
    public static void sort(LinkedList<Worker> linkedList){
        List<Worker> list = new ArrayList<>();
        for (Worker worker : linkedList) {
            list.add(worker);
        }
        Collections.sort(list, new Comparator<Worker>() {
            @Override
            public int compare(Worker o1, Worker o2) {
                if(o1.getId() != o2.getId()){
                    return o1.getId() - o2.getId();
                }
                return 0;
            }
        });
        System.out.println("*********排序后*************");
        list.forEach(System.out::println);
    }

    //涨工资
    public static void addSalsry(LinkedList<Worker> linkedList){
        if(linkedList==null){
            return;
        }
        if(linkedList.size() != 0){
            for (Worker worker : linkedList) {
                if(worker.getSex() == '男'){
                    double v = worker.getSalary() + 200;
                    System.out.println(worker);
                    System.out.println("添加后工资为:" + v);

                }
            }
        }
    }

    //修改
    public static void set(LinkedList<Worker> linkedList){
        ListIterator<Worker> list = linkedList.listIterator();
        while(list.hasNext()){
            Worker next = list.next();
            if(next.getSalary()>5000){
                next.setLevel('H');
            }
            System.out.println(next);
        }

    }
}


package com.Work3;

import java.util.LinkedList;

/**
 * @Author: 廾匸
 * @Date: 2020/11/20 22:01
 * @Description: 测试类
 * @version: 1.01
 */
public class Test {
    public static void main (String[] args){

        LinkedList<Worker> linkedList = new LinkedList<>();
        Methed.save(linkedList,new Worker());

        System.out.println("******************输出后*********************");
        Methed.show(linkedList);

        Methed.sort(linkedList);

        System.out.println("******************添加工资后*********************");
        Methed.addSalsry(linkedList);

        System.out.println("*************级别修改后******************");
        Methed.set(linkedList);
    }
}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值