Set集合

在这里插入图片描述

HashSet()

存储Integer类:

    public static void main(String[] args) {
        HashSet<Integer> hashSet = new HashSet<>();
        hashSet.add(100);
        hashSet.add(100);
        hashSet.add(200);
        hashSet.add(300);
        hashSet.add(400);
        for (Integer integer : hashSet) {
            System.out.println(integer);
        }
    }
}

存储字符串

    public static void main(String[] args) {
        HashSet<String> stringHashSet = new HashSet<>();
        stringHashSet.add("wfwafwa");
        stringHashSet.add("afwaf");
        stringHashSet.add("ujtffj");
        for (String s : stringHashSet) {
            System.out.println(s);
        }
    }
}

存储自定义类

    private String name;
    private int age;

    public Student(String name, int age) {
        this.name = name;
        this.age = age;
    }

    public Student() {

    }

    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 hashCode() {
        return super.hashCode();
    }

    @Override
    public boolean equals(Object obj) {
        return super.equals(obj);
    }
}public class HashSetDemo2 {
    public static void main (String[] args) {
        HashSet<Student> hs = new HashSet<Student>();
        hs.add( new Student("zhangsan", 19 ) );
        hs.add( new Student("zhangsan", 19 ) );
        hs.add( new Student("lisi", 20 ) );
        hs.add( new Student("wangwu", 22 ) );
        for (Student s : hs) {
            System.out.println(s.getName()+s.getAge());
        }
    }
}

LinkedHashSet()

    public static void main(String[] args) {
        LinkedHashSet<Integer> integers = new LinkedHashSet<>();
        integers.add(1);
        integers.add(3);
        integers.add(2);
        integers.add(100);
        integers.add(80);
        for (Integer integer : integers) {
            System.out.println(integer);
        }
    }
}

TreeSet()

自然排序

    private String name;
    private int age;

    public Student() {
    }

    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 int compareTo(Student s) {
        int num=this.age-s.getAge();
        int num2=num==0?this.name.compareTo(s.name):num;
        return num2;
    }
}
public class TreeSetDemo {
    public static void main(String[] args) {
        Student s1 = new Student("zhangsan", 14);
        Student s2 = new Student("lisi", 15);
        Student s3 = new Student("wangwu", 18);
        Student s4 = new Student("zhaoliu", 13);
        TreeSet<Student> treeSet = new TreeSet<>();
        treeSet.add(s1);
        treeSet.add(s2);
        treeSet.add(s3);
        treeSet.add(s4);
        for (Student student : treeSet) {
            System.out.println(student.getName()+"-------->"+student.getAge());
        }
    }
}

比较器排序

    private String name;
    private int age;

    public Student(String name, int age) {
        this.name = name;
        this.age = age;
    }

    public Student() {

    }

    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 + '\'' +
                '}';
    }
}
public class TreeSetDemo {
    public static void main(String[] args) {
        TreeSet<Student> treeSet = new TreeSet<>(new Comparator<Student>() {
            @Override
            public int compare(Student s1, Student s2) {
                int num=s1.getName().length()-s2.getName().length();
                int num2=num==0?s1.getName().compareTo(s2.getName()):num;
                int num3=num2==0?s1.getAge()-s2.getAge():num2;
                return num3;
            }
        });
        Student s1 = new Student("zhangsan", 14);
        Student s2 = new Student("lisi", 15);
        Student s3 = new Student("wangwu", 18);
        Student s4 = new Student("zhaoliu", 13);
        treeSet.add(s1);
        treeSet.add(s2);
        treeSet.add(s3);
        treeSet.add(s4);
        for (Student student : treeSet) {
            System.out.println(student.getName()+"-------->"+student.getAge());
        }
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值