前言
目录
一、set的特点
1、不可重复
2、无序
注意:不重复必须是基本数据类型&String,引用数据不可,当你new一个String时该String是引用数据类型
二、set的遍历方式
1、foreach遍历
2、迭代器遍历
三、HashSet哈希表存储,重复元素存储底层探究
四、TreeSet
1、自然排序
2、比较器排序
一、set的特点
1、不可重复
2、无序
2、无序
代码段(不重复):
package com.zwc.set;
import java.util.HashSet;
import java.util.Iterator;
public class Demo1 {
public static void main(String[] args) {
HashSet
运行结果:
注意:不重复必须是基本数据类型&String,引用数据不可,当你new一个String时该String是引用数据类型
二、set的遍历方式
1、foreach遍历
2、迭代器遍历
2、迭代器遍历
代码如下(foreach遍历):
package com.zwc.set;
import java.util.HashSet;
import java.util.Iterator;
public class Demo1 {
public static void main(String[] args) {
HashSet
运行结果:
三、HashSet哈希表存储,重复元素存储底层探究
结论:set集合去重原理
1、set去重底层原理是与对象的hashCode以及equals方法相关
2、判断重复元素的时候,是比较hashCode值,在调用equals比较内容
代码如下:
package com.zwc.set;
import java.util.HashSet;
public class Demo2 {
public static void main(String[] args) {
HashSet set = new HashSet<>();
set.add(new Person("zs", 18));
set.add(new Person("ls", 18));
set.add(new Person("ww", 18));
set.add(new Person("老六", 18));
set.add(new Person("zs", 18));
System.out.println(set.size());
}
}
class Person {
private String name;
private int age;
private int level;
public Person(String name, int age, int level) {
super();
this.name = name;
this.age = age;
this.level = level;
}
public int getLevel() {
return level;
}
public void setLevel(int level) {
this.level = level;
}
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;
}
public Person() {
// TODO Auto-generated constructor stub
}
public Person(String name, int age) {
super();
this.name = name;
this.age = age;
}
@Override
public String toString() {
return "Person [name=" + name + ", age=" + age + ", level=" + level + "]";
}
@Override
public int hashCode() {
System.out.println("---------hashCode-------------");
final int prime = 31;
int result = 1;
result = prime * result + age;
result = prime * result + ((name == null) ? 0 : name.hashCode());
return 1;
}
@Override
public boolean equals(Object obj) {
System.out.println("---------equeals-------------");
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Person other = (Person) obj;
if (age != other.age)
return false;
if (name == null) {
if (other.name != null)
return false;
} else if (!name.equals(other.name))
return false;
return true;
}
// @Override
// public int compareTo(Person o) {
// int levelRes = this.level - o.level;
// return levelRes == 0 ? this.age - o.age : levelRes;
// }
//
}
效果如下:
四、TreeSet
1、自然排序
2、比较器排序
2、比较器排序
自然排序: java.lang.Comparable:自然排序 排序的规则是单一的,不能应对复杂的变化的需求
比较器排序:java.util.comparator
当你定义一个对象把它加到Treeset中,则该对象必须实现Comparable接口,不然会报异常: ClassCastException类型转换接口
案例:
代码如下:
package com.zwc.set;
import java.util.Comparator;
import java.util.TreeSet;
public class Demo3 {
public static void main(String[] args) {
// ClassCastException类型转换接口
// Exception in thread "main" java.lang.ClassCastException:
// com.zwc.set.Person cannot be cast to java.lang.Comparable
//按年龄排序
// TreeSet set = new TreeSet<>(new levelCompartor());
//按名字排序
// TreeSet set = new TreeSet<>((x,y)->x.getName().compareTo(y.getName()));
//按年龄排序
TreeSet set = new TreeSet<>((x,y)->{
int ageRes = x.getAge() - y.getAge();
int levelRes = 0;
if(ageRes==0) {
levelRes = x.getLevel() - y.getLevel();
}
else {
return ageRes;
}
return levelRes;
});
set.add(new Person("zs", 18, 1));
set.add(new Person("ls", 24, 4));
set.add(new Person("ww", 26, 2));
set.add(new Person("laoliu", 20, 3));
set.add(new Person("bajie", 18, 3));
for (Object object : set) {
System.out.println(object);
}
}
public static void main2(String[] args) {
TreeSet set1 = new TreeSet<>();
set1.add("2");
set1.add("4");
set1.add("6");
set1.add("7");
set1.add("8");
set1.add("1");
for (Object object : set1) {
System.out.println(object);
}
// ClassCastException类型转换接口
// Exception in thread "main" java.lang.ClassCastException:
// com.zwc.set.Person cannot be cast to java.lang.Comparable
TreeSet set = new TreeSet<>();
set.add(new Person("zs", 18, 1));
set.add(new Person("ls", 24, 4));
set.add(new Person("ww", 26, 2));
set.add(new Person("laoliu", 20, 3));
set.add(new Person("bajie", 18, 3));
for (Object object : set) {
System.out.println(object);
}
}
}
class levelCompartor implements Comparator{
@Override
public int compare(Person o1, Person o2) {
int levelRes = o1.getLevel() - o2.getLevel();
return levelRes==0? o1.getAge() - o2.getAge():levelRes;
}
}
运行结果



