我有这个HashMap:
HashMap<String, Integer> m它基本上存储任何单词(字符串)及其频率(整数)。以下代码是按值对HashMap进行排序的:
public static Map<String, Integer> sortByValue(Map<String, Integer> map) {
List<Map.Entry<String, Integer>> list = new LinkedList<Map.Entry<String, Integer>>(map.entrySet());
Collections.sort(list, new Comparator<Map.Entry<String, Integer>>() {
public int compare(Map.Entry<String, Integer> m1, Map.Entry<String, Integer> m2) {
return (m2.getValue()).compareTo(m1.getValue());
}
});
Map<String, Integer> result = new LinkedHashMap<String, Integer>();
for (Map.Entry<String, Integer> entry : list) {
result.put(entry.getKey(), entry.getValue());
}
return result;
}现在场景已经改变了,我有这样的想法:
HashMap<String, doc>;
class doc{
integer freq;
HashMap<String, Double>;
}如何按照与sortByValue相同的方法按值对此HashMap进行排序?
发布于 2011-11-01 18:40:18
您必须创建一个自定义比较器,如下所示:
import java.util.Comparator;
import java.util.Arrays;
public class Test {
public static void main(String[] args) {
String[] strings = {"Here", "are", "some", "sample", "strings", "to", "be", "sorted"};
Arrays.sort(strings, new Comparator<String>() {
public int compare(String s1, String s2) {
int c = s2.length() - s1.length();
if (c == 0)
c = s1.compareToIgnoreCase(s2);
return c;
}
});
for (String s: strings)
System.out.print(s + " ");
}
}发布于 2011-12-31 00:24:30
@jackturky代替
public int compare(String s1, String s2) {
int c = s2.length() - s1.length();
if (c == 0)
c = s1.compareToIgnoreCase(s2);
return c;
}为什么不像这样写(这当然是检查null和空字符串)
public int compare(String s1, String s2) {
return s1.compareToIgnoreCase(s2);
}https://stackoverflow.com/questions/7965132
复制相似问题