Java——hashMap去重和排序

本文详细介绍如何利用HashMap实现去重,并通过自定义Student类的compareTo方法完成集合排序。通过具体示例,展示了如何在Java中操作HashMap进行数据处理。

hashMap去重/排序:

  1)map集合需要键名唯一,hashmap是通过hashcode和eauals来控制键名唯一;

  2)从写Comparable中的compareTo方法来对map集合排序;

  1、实体类:

public class Student implements Comparable<Student>{
    private String name;
    private int age;
    public Student(String name, int age) {
        this.name = name;
        this.age = age;
    }
    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;
    }
    @Override
    public String toString() {
        return "Student{" +
                "name='" + name + '\'' +
                ", age=" + age +
                '}';
    }

    @Override
    public int compareTo(Student s) {
        int num = new Integer(this.getAge()).compareTo(new Integer(s.getAge()));
        if (num == 0) {
            num = this.getName().compareTo(s.getName());
        }
        return num;
    }

    @Override
    public int hashCode() {
        System.out.println(this.name+".....hashCode");
        return this.getName().hashCode();
    }
    @Override
    public boolean equals(Object obj) {
        if (this == obj) return true;
        if (!(obj instanceof Student)) return false;
        Student s = (Student) obj;
        System.out.println(this.name+this.age+"..equals..");
        return this.getName().equals(s.getName()) && this.getAge() == s.getAge();
    }
}

  2、测试类;

public class Test {
    public static void main(String[] args) {
        Map<Student, String> ms = new HashMap<Student, String>();
        ms.put(new Student("张三", 10), "北京");
        ms.put(new Student("张五", 12), "南京");
        ms.put(new Student("张五", 12), "北京");
        ms.put(new Student("张五", 13), "北京");

        Set<Map.Entry<Student, String>> entries = ms.entrySet();
        for (Iterator<Map.Entry<Student, String>> it2 = entries.iterator(); it2.hasNext(); ) {
            Map.Entry<Student, String> next = it2.next();
            System.out.println(next.getKey() + "====" + next.getValue());
        }
    }
}

 

转载于:https://www.cnblogs.com/Tractors/p/11247592.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值