TreeMap使用和底层实现原理

最新推荐文章于 2024-07-31 15:39:41 发布

W思聪、

最新推荐文章于 2024-07-31 15:39:41 发布

阅读量398

点赞数

本文链接：https://blog.csdn.net/qq_39696115/article/details/104736071

版权

package text02;

import java.util.Map;
import java.util.TreeMap;

//TreeMap的使用  存储自动排序
public class text {
 public static void main(String[] args) {
	  Map<Integer,String> treemap1=new TreeMap<>();
	  treemap1.put(20,"aa");
	  treemap1.put(10,"bb");
	  treemap1.put(9,"cc");
	  
	  for(Integer key:treemap1.keySet()) {
		  System.out.println(key+"---"+treemap1.get(key));
	  }
	  Map<Emp,String> treemap2=new TreeMap<Emp, String>();
	  treemap2.put(new Emp(1001,"张三",10000), "张三是个好小伙");
	  treemap2.put(new Emp(1002,"张嗣",50000),"张思是个坏男孩");
	  treemap2.put(new Emp(1003,"张五",100000),"你妹的");
	  for(Emp key:treemap2.keySet()) {
		  System.out.println(key+"---"+treemap2.get(key));
	  }
}
}
class Emp implements Comparable<Emp>{
	int id;
	String name;
	double salary;
	public Emp(int id, String name, double salary) {
		super();
		this.id = id;
		this.name = name;
		this.salary = salary;
	}
	@Override
	public String toString() {
		return "id:"+id+",name:"+name+",salary"+salary;
	}
  public int compareTo(Emp o) {
	  if(this.salary>o.salary) {
		  return 1;
	  }else if(this.salary<o.salary){
		  return -1;
	  }else {
		  if(this.id>o.id) {
			  return 1;
		  }else if(this.id<o.id){
			  return -1;
		  }else {
			  return 0;
		  }
	  }
	  
  }
	
}