Java相关排序
2014-07-04 16:19
459 查看
1、If
it is a collection, use Collections.sort() method.
// Collections.sort
List<ObjectName> list = new ArrayList<ObjectName>();
Collections.sort(list, new Comparator<ObjectName>() {
public int compare(ObjectName o1, ObjectName o2) {
return o1.toString().compareTo(o2.toString());
}
});2、If
it is an array, use
// Arrays.sort
ObjectName[] arr = new ObjectName[10];
Arrays.sort(arr, new Comparator<ObjectName>() {
public int compare(ObjectName o1, ObjectName o2) {
return o1.toString().compareTo(o2.toString());
}
});If
it is a list or set, use
sort.
// TreeSet
Set<ObjectName> sortedSet = new TreeSet<ObjectName>(new Comparator<ObjectName>() {
public int compare(ObjectName o1, ObjectName o2) {
return o1.toString().compareTo(o2.toString());
}
});
sortedSet.addAll(unsortedSet);If
it is a map, use
sort.
sorted by key.
// TreeMap - using String.CASE_INSENSITIVE_ORDER which is a Comparator that orders Strings by compareToIgnoreCase
Map<String, Integer> sortedMap = new TreeMap<String, Integer>(String.CASE_INSENSITIVE_ORDER);
sortedMap.putAll(unsortedMap);
http://www.programcreek.com/2014/03/how-developers-sort-in-java/
it is a collection, use Collections.sort() method.
// Collections.sort
List<ObjectName> list = new ArrayList<ObjectName>();
Collections.sort(list, new Comparator<ObjectName>() {
public int compare(ObjectName o1, ObjectName o2) {
return o1.toString().compareTo(o2.toString());
}
});2、If
it is an array, use
Arrays.sort()method.
// Arrays.sort
ObjectName[] arr = new ObjectName[10];
Arrays.sort(arr, new Comparator<ObjectName>() {
public int compare(ObjectName o1, ObjectName o2) {
return o1.toString().compareTo(o2.toString());
}
});If
it is a list or set, use
TreeSetto
sort.
// TreeSet
Set<ObjectName> sortedSet = new TreeSet<ObjectName>(new Comparator<ObjectName>() {
public int compare(ObjectName o1, ObjectName o2) {
return o1.toString().compareTo(o2.toString());
}
});
sortedSet.addAll(unsortedSet);If
it is a map, use
TreeMapto
sort.
TreeMapis
sorted by key.
// TreeMap - using String.CASE_INSENSITIVE_ORDER which is a Comparator that orders Strings by compareToIgnoreCase
Map<String, Integer> sortedMap = new TreeMap<String, Integer>(String.CASE_INSENSITIVE_ORDER);
sortedMap.putAll(unsortedMap);
//TreeMap - In general, defined comparator Map<ObjectName, String> sortedMap = new TreeMap<ObjectName, String>(new Comparator<ObjectName>() { public int compare(ObjectName o1, ObjectName o2) { return o1.toString().compareTo(o2.toString()); } }); sortedMap.putAll(unsortedMap);
http://www.programcreek.com/2014/03/how-developers-sort-in-java/
相关文章推荐
- Java中排序相关
- Java基本功练习五(一维数组相关操作[声明、创建、乱序、排序、查找]和方法的重载举例[浅议])
- java相关总结4--冒泡、选择、快速、插入排序
- 【Java相关】Java中TreeSet和HashSet的排序和去重
- Java -------- 首字母相关排序总结
- java:Comparable类的排序相关
- Java中利用比较器对一个对象的相关属性的排序
- java 相关排序
- Java功底篇系列-02-如何理解实际开发中与“排序”相关的问题
- 我在学JAVA——排序、查找相关知识
- 剑指offer面试题java实现之题4之相关题目:两个排序数组合并
- JAVA相关基础知识(一)(转贴)
- JAVA相关基础知识(1)
- JAVA开发相关的各类软件包下载及使用指南(jspSmartUpload)
- JAVA相关基础知识(6)
- 学习Java的相关知识
- JAVA相关基础知识(2)
- JAVA相关基础知识(7)
- JAVA相关基础知识 选择自fanlitcn 的Blog
- JAVA相关基础知识(3)