一：引言

當(dāng)用到了TreeMap時(shí)候，是因?yàn)橐鶕?jù)鍵值進(jìn)行排序，使輸出的結(jié)果是按遞增順序的

二：上碼

package cn.wyj.two;import java.util.Map; import java.util.TreeMap;/*** 一般當(dāng) 鍵值需要排序時(shí)，我們會(huì)選擇用 TreeMap* **/ public class Demo6_TreeMap {public static void main(String[] args) {Map<Integer,String> m1 = new TreeMap<Integer,String>();m1.put(20, "aa");m1.put(2, "bb");m1.put(5, "cc");System.out.println(m1.toString());Map<Emp,String> m2 = new TreeMap<Emp,String>();m2.put(new Emp(100,"王大爺",10000), "勤勞");m2.put(new Emp(102,"王二爺",5000), "善良");m2.put(new Emp(99,"王三爺",20000), "勇敢");m2.put(new Emp(39,"王4爺",20000), "不要命");System.out.println(m2);}}class Emp implements Comparable<Emp>{private int id;private String name;private int slary;public Emp(int id, String name, int slary) {super();this.id = id;this.name = name;this.slary = slary;}@Overridepublic String toString() {// TODO Auto-generated method stubreturn "Id:"+ this.id+" Name:" + this.name + " Salry:" +this.slary;}@Overridepublic int compareTo(Emp o) {//負(fù)數(shù)：小于； 0 ： 等于 ； 正數(shù)：大于// TODO Auto-generated method stubif(this.slary > o.slary){return 1;}else if(this.slary < o.slary){return -1;}else{if(this.id > o.id){return 1;}else if( this.id < o.id){return -1;}}return 0;}}

如有疑問歡迎留言！

總結(jié)

以上是生活随笔為你收集整理的Java当中TreeMap用法的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。