Sort <String，Double> HashMap使用比较器但不使用TreeMap

import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.TreeMap;

public class HashMapSortExample {
    public static void main(String[] args) {
        Map<String, Double> hashMap = new HashMap<>();
        hashMap.put("A", 5.6);
        hashMap.put("B", 2.3);
        hashMap.put("C", 8.1);
        hashMap.put("D", 1.9);
        
        // 使用比较器对HashMap进行排序
        Map<String, Double> sortedMap = new TreeMap<>(new ValueComparator(hashMap));
        sortedMap.putAll(hashMap);
        
        // 打印排序后的结果
        for (Map.Entry<String, Double> entry : sortedMap.entrySet()) {
            System.out.println(entry.getKey() + ": " + entry.getValue());
        }
    }
    
    static class ValueComparator implements Comparator<String> {
        Map<String, Double> baseMap;
        
        public ValueComparator(Map<String, Double> baseMap) {
            this.baseMap = baseMap;
        }
        
        @Override
        public int compare(String key1, String key2) {
            Double value1 = baseMap.get(key1);
            Double value2 = baseMap.get(key2);
            return value1.compareTo(value2);
        }
    }
}