treeMap 案例
/*
* TreeMap的使用
* 存储结构:红黑树
* */
public class TreeMapTest {
public static void main(String[] args) {
//创建集合
TreeMap<Student, String> studentStringTreeMap = new TreeMap<>();
//添加元素
Student s1=new Student("张三",11);
Student s2=new Student("李四",12);
Student s3=new Student("王五",13);
studentStringTreeMap.put(s1,"上海");
studentStringTreeMap.put(s2,"南京");
studentStringTreeMap.put(s3,"西安");
System.out.println("元素个数"+studentStringTreeMap.size());
System.out.println(studentStringTreeMap.toString());
//2.删除元素
// studentStringTreeMap.remove(s1,"上海");
// System.out.println("元素个数"+studentStringTreeMap.size());
// System.out.println(studentStringTreeMap.toString());
//3.遍历循环
System.out.println("----------keySet-------------");
for (Student student : studentStringTreeMap.keySet()) {
System.out.println(student+"----"+studentStringTreeMap.get(student));
}
System.out.println("------------entryset-------------");
for (Map.Entry<Student, String> stringEntry : studentStringTreeMap.entrySet()) {
System.out.println(stringEntry);
}
//4.判断
System.out.println(studentStringTreeMap.containsKey(new Student("张三",11)));
System.out.println(studentStringTreeMap.containsValue("西安"));
}
}
实体类
public class Student implements Comparable<Student>{
private String name;
private int aga;
public Student(String name, int aga) {
this.name = name;
this.aga = aga;
}
public Student() {
}
public String getName() {
return name;
}
public int getAga() {
return aga;
}
public void setName(String name) {
this.name = name;
}
public void setAga(int aga) {
this.aga = aga;
}
@Override
public String toString() {
return "Student{" +
"name='" + name + '\'' +
", aga=" + aga +
'}';
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Student student = (Student) o;
return aga == student.aga &&
Objects.equals(name, student.name);
}
@Override
public int hashCode() {
return Objects.hash(name, aga);
}
public int compareTo(Student o) {
int n1=this.aga-o.getAga();
return n1;
}
}