在Java中,可以通过Comparator接口来实现对KeySet的排序。下面是基本的排序方法: // 创建一个Map并初始化Map<String,Integer>map=newHashMap<>();map.put("banana",3);map.put("apple",2);map.put("orange",4);// 将Map的KeySet转换为ListList<String>sortedKeys=newArrayList<>(map.keySet());// 使用Co...
stu.put("egg", "11");//map的遍历:把key抽取出来用set存放,然后用迭代器遍历keyset,同时用map.get(KEY)获取key所对应的value。 Set keySet=stu.keySet(); Iterator it=keySet.iterator();while(it.hasNext()) { String next=(String)it.next(); System.out.println(next+","+stu.get(next)); } }...
map.put("goods1","0201"); map.put("goods4","01"); map.put("goods2","0304"); map.put("goods3","0101"); Object[] key = map.keySet().toArray(); Arrays.sort(key); for(inti=0; i < key.length; i++) { System.out.println(map.get(key[i])); } 参考博文: (1)https://...
map.put("a","ddddd"); Set<String> keySet =map.keySet(); Iterator<String>iter = keySet.iterator(); while(iter.hasNext()) { String key = iter.next(); System.out.println(key +":"+map.get(key)); } } } 运行结果如下: d:aaaaa c:bbbbb b:ccccc a:ddddd 三.value排序 上面例子是对...
importjava.util.*;publicclassSortMapKeys{publicstaticvoidmain(String[]args){Map<String,Integer>map=newHashMap<>();map.put("one",1);map.put("three",3);map.put("five",5);map.put("two",2);map.put("four",4);List<String>sortedKeys=newArrayList<>(map.keySet());Collections.sort(sorted...
通过Map.keySet遍历key和value: key= 11 and value= value1 key= zame and value= value2 key= name and value= value3 key= 3 and value= value4 2.按key hash值排序 HashMap Map<String, String> map = new HashMap<String, String>(); ...
map.put(1,"小"); map.put(8,"记"); map.put(9,"得"); map.put(7,"客"); map.put(5,"的"); map.put(6,"博"); map.put(4,"豆"); map.put(3,"糖"); map.put(2,"小"); System.out.println("排序前");for(Iteratorit=map.keySet().iterator();it.hasNext();){ ...
Map<String, List<Integer>> sortedMap = new LinkedHashMap<>(); // 将排序后的List放回到有序Map中 int i = 0; for (String key : map.keySet()) { sortedMap.put(key, list.get(i)); i++; } // 打印排序后的Map for (Map.Entry<String, List<Integer>> entry : sortedMap.entrySet...
使用TreeMap 。这正是它的用途。如果这张地图传递给你,而你无法确定类型,那么你可以执行以下操作:SortedSet<String> keys = new TreeSet<>(map.keySet()); for (String key : keys) { String value = map.get(key); // do something } 这将按键的自然顺序遍历地图。