Map<String, QuotaSort> map = new HashMap<String, QuotaSort>();
map.put("1", new QuotaSort("1", "11", 1));
map.put("4", new QuotaSort("4", "44", 4));
map.put("2", new QuotaSort("2", "22", 2));
map.put("3", new QuotaSort("3", "33", 3));
List<QuotaSort> list = new ArrayList<>(map.values());
/*list.sort(new Comparator<QuotaSort>() {
@Override
public int compare(QuotaSort o1, QuotaSort o2) {
if (o1.sequence > o2.sequence) {
return 1;
} else if (o1.sequence == o2.sequence) {
return 0;
} else {
return -1;
}
}
});
Comparator<QuotaSort> c = (o1, o2) -> {
if (o1.sequence > o2.sequence) {
return 1;
} else if (o1.sequence == o2.sequence) {
return 0;
} else {
return -1;
}
};*/
list.sort((a, b) -> a.name.compareTo(b.name));
// list.sort(c);
for (QuotaSort stu : list) {
System.out.println("姓名:" + stu.name);
}
这可能还不是最精简版,希望善于研究的人可以更好发掘。