今天给大家说说怎么把TreeMap 的值进行排序,TreeMap 默认排序规则:按照key的字典顺序来排序(升序)
而HashMap在放入的时候已经内部规定好排序了,TreeMap可以可以自定义排序,废话不多说,上代码!
首先,这里创建了一个User类如下:
public class User {
private String name;
private int age;
private int id;
@Override
public String toString() {
return "User [name=" + name + ", age=" + age + ", id=" + id + "]";
}
public User(String name, int age, int id) {
super();
this.name = name;
this.age = age;
this.id = id;
}
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 int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
}
然后呢,根据键排序,创建测试类如下:
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.TreeMap;
public class Test {
public static void main(String[] args) {
Map<Integer, User> map = new TreeMap<>(new Comparator<Integer>() {
@Override
public int compare(Integer o1, Integer o2) {
return o1 - o2;
}
});
map.put(5, new User("张三", 12, 3));
map.put(6, new User("李四", 14, 4));
map.put(2, new User("王五", 10, 9));
map.put(9, new User("赵六", 19, 1));
map.put(3, new User("宋琦", 22, 7));
map.put(6, new User("关羽", 8, 6));
Iterator<Entry<Integer, User>> iter = map.entrySet().iterator();
while (iter.hasNext()) {
System.out.print(iter.next().getKey() + "\t");
}
下来就是根据值排序了,我们先根据年龄排序:
List<Map.Entry<Integer, User>> list = new ArrayList<>(map.entrySet());
Collections.sort(list, new Comparator<Map.Entry<Integer, User>>() {
@Override
public int compare(Entry<Integer, User> o1, Entry<Integer, User> o2) {
return o1.getValue().getAge() - o2.getValue().getAge();
}
});
for (Entry<Integer, User> entry : list) {
System.out.print(entry.getValue().getAge() + "\t");
}
再下来我们根据id排序:
List<Map.Entry<Integer, User>> list2 = new ArrayList<Map.Entry<Integer, User>>(map.entrySet());
Collections.sort(list2, new Comparator<Map.Entry<Integer, User>>() {
@Override
public int compare(Entry<Integer, User> o1, Entry<Integer, User> o2) {
return o1.getValue().getId() - o2.getValue().getId();
}
});
for (Entry<Integer, User> entry : list2) {
System.out.print(entry.getValue().getId() + "\t");
}
![结果图](https://i-blog.csdnimg.cn/blog_migrate/51ad226604f7fe57963dfce6d54c6d20.png)
我们在排序值得时候,是把TreeMap放到List里进行排序,所以,取出来的时候也是必须要从list里取
好了.今天的分享就到这里,如果发现错误请及时联系更改,以免误人子弟!