java Set集合

set集合的特点是无序，唯一。所以在学生类中要重写equals和hashCode方法

1.标准的学生类

package Set;

import java.util.Objects;

public class Student {
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 boolean equals(Object o) {
    if (this == o) return true;
    if (o == null || getClass() != o.getClass()) return false;
    Student student = (Student) o;
    return age == student.age &&
            name.equals(student.name);
}

@Override
public int hashCode() {
    return Objects.hash(name, age);
}

@Override
public String toString() {
    return "Student{" +
            "name='" + name + '\'' +
            ", age=" + age +
            '}';

}
}

2,测试类

package Set; 
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;

public class Test {
public static void main(String[] args) {
    Set<Student> set= new HashSet<>();
    Student s1=new Student("张三",4);
    Student s2=new Student("李四",85);
    Student s3=new Student("王五",55);
    Student s4=new Student("张三",4);
    Student s5=new Student("王五",55);

    set.add(s1);
    set.add(s2);
    set.add(s3);
    set.add(s4);
    set.add(s5);
    System.out.println(set);
    System.out.println("-------------");
    //遍历集合
    System.out.println("通过迭代器遍历");
    //1.通过集合对象获取对应的迭代器对象
    Iterator<Student> it=set.iterator();
    //2.判断迭代器中是否有元素
    while (it.hasNext()){
        Student s=it.next();//3.如果有元素则接
        System.out.println(s);
    }
    System.out.println("-------------");
    System.out.println("通过增强for遍历");
    for (Student student : set) {
        System.out.println(student);
    }


}
}

输出：