让我们用Java创建TreeMap。它按升序存储唯一元素-
TreeMap<Integer,String> m = new TreeMap<Integer,String>();
现在让我们添加一些元素-
m.put(1,"PHP"); m.put(2,"jQuery"); m.put(3,"JavaScript"); m.put(4,"Ruby"); m.put(5,"Java"); m.put(6,"AngularJS"); m.put(7,"ExpressJS");
以下是创建TreeMap的示例-
import java.util.*;
public class Demo {
public static void main(String args[]) {
TreeMap<Integer,String> m = new TreeMap<Integer,String>();
m.put(1,"PHP");
m.put(2,"jQuery");
m.put(3,"JavaScript");
m.put(4,"Ruby");
m.put(5,"Java");
m.put(6,"AngularJS");
m.put(7,"ExpressJS");
for(Map.Entry e:m.entrySet()){
System.out.println(e.getKey()+" "+e.getValue());
}
}
}输出结果
1 PHP 2 jQuery 3 JavaScript 4 Ruby 5 Java 6 AngularJS 7 ExpressJS