Map的遍历和排序

package com.gddxit.waterpower.jpa.service;

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

public class Demo {
    public static void main(String[] args) {
        for (int i = 0; i < 1; i++) {
            Map<Integer, String> test = new HashMap<>();
            test.put(32, "c");
            test.put(20, "b");
            test.put(5, "e");
            test.put(42, "d");
            test.put(1, "a");
            //排序前
            for (Map.Entry<Integer, String> test1 : test.entrySet()) {
                System.out.print(test1.getKey() + ",");
            }
            System.out.println();
            //排序后
            Map<Integer, String> test2 = new TreeMap<>(test);
            for (Map.Entry<Integer, String> test1 : test2.entrySet()) {
                System.out.print(test1.getKey() + ",");
            }

        }
    }
}

运行结果：