Set接口介绍:
- 无序,不重复
- forech,迭代器遍历
- 初始容量16,负载因子0.75,扩容1倍
实现类:
1.Hashset
- 线程不安全
- 通过hashcode区分
- 由hashset支持
- 它存储唯一元素并且允许空值
代码知识:
使用hashset去重
public class SetDemo {
private List<Integer> list = new ArrayList<>();
@BeforeAll
public void setup() {
set.add(1);
set.add(1);
set.add(2);
set.add(2);
set.add(3);
set.add(3);
}
@Test
public void test01() {
List<Integer> tmp = new ArrayList<>(new HashSet<Integer>(list));
System.out.println(tmp);
}
}
2.两种遍历方式
添加元素
Set<Integer> set=new HashSet<>();
set.add(1);
set.add(2);
set.add(2);
set.add(4);
set.add(3);
set.add(5);
Test01(set);
迭代器遍历Iterator
public static void Test01(Set<Integer> set) {
Iterator<Integer> it=set.iterator();
while(it.hasNext()) {
System.out.println(it.next());
}
}
forech遍历
public static void Test01(Set<Integer> set) {
for (Integer i : set) {
System.out.println(i);
}
2.TreeSet
- 特点:包含一个有序且不重复的数组
- 作用:提供有序的set结合,默认升序,自定义排序的话可以使用compartor比较函数
代码知识
创建一个学生类并实现编比较器接口
public class Student implements Comparable<Student>{
private Integer sid;
private String sname;
private int age;
public Student(Integer sid, String sname, int age) {
super();
this.sid = sid;
this.sname = sname;
this.age = age;
}
public Integer getSid() {
return sid;
}
public void setSid(Integer sid) {
this.sid = sid;
}
public String getSname() {
return sname;
}
public void setSname(String sname) {
this.sname = sname;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
}
还需要在这个学生类中提供hashCode和equals方法:
/*
*hashCode可以将学号名字努力转成唯一的数字,相对于身份证
*/
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + age;
result = prime * result + ((sid == null) ? 0 : sid.hashCode());
result = prime * result + ((sname == null) ? 0 : sname.hashCode());
return result;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Student other = (Student) obj;
if (age != other.age)
return false;
if (sid == null) {
if (other.sid != null)
return false;
} else if (!sid.equals(other.sid))
return false;
if (sname == null) {
if (other.sname != null)
return false;
} else if (!sname.equals(other.sname))
return false;
return true;//学号名字年龄都相等才是同一个学生
}
@Override
public String toString() {
return "Student [sid=" + sid + ", sname=" + sname + ", age=" + age + "]";
}
/**
* 实现Comparable<Student>接口后需要重写的方法
* 根据年龄排序,年龄相同则比较学号,默认是升序
*/
@Override
public int compareTo(Student o) {
if(this.getAge()-o.getAge()==0) {
return this.getSid()-o.getSid();
}
return this.getAge() - o.getAge();
}
然后再使用ThreeSet
@Test
public void test04() {
TreeSet<Student> stu = new TreeSet<>();
stu.add(new Student(1,"zs", 18));
stu.add(new Student(1,"zs", 18));
stu.add(new Student(2,"ls", 19));
stu.add(new Student(4,"lihao", 10));
stu.add(new Student(7,"lihao", 18));
stu.add(new Student(5,"zengfanyan", 20));
stu.add(new Student(3,"we", 30));
for(Student s: stu) {
System.out.println(s);
}
}