HashMap 按值排序的静态工具类

假设存在这样一个业务逻辑：
记录某学生的语文、数学、英语、物理、化学成绩，放入HashMap中。现要求求得该生优势学科（得分最高的科目）与劣势学科（得分最低的科目），然后提示该生扬长补短。
那么可写静态工具类（懒汉模式）如下：

class SortHashMap{
	
	private static SortHashMap instance = null;
	
	private SortHashMap(){
		
	}
	
	public static SortHashMap getInstance(){
		if(instance == null){
			return new SortHashMap();
		}
		return new SortHashMap();
	}
	
	public static String getMax(HashMap<String, Integer> hashMap){
		String maxString = "";
		Set<Map.Entry<String, Integer>> entrySet = hashMap.entrySet();
        List<Map.Entry<String, Integer>> list = new ArrayList<>(hashMap.entrySet());
        Collections.sort(list, new Comparator<Map.Entry<String, Integer>>(){
            @Override
            public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2)
            {
                return o1.getValue().compareTo(o2.getValue());
            }
        });
        
        List<Map.Entry<String, Integer>> sList = new ArrayList<>();
        for (Map.Entry s : list){
            sList = list;
        }
        return maxString + "Max Key is: " + sList.get(hashMap.size() - 1).getKey() + ", Max Value is: " + sList.get(hashMap.size() - 1).getValue();
	}
	
	public static String getMin(HashMap<String, Integer> hashMap){
		String minString = "";
		Set<Map.Entry<String, Integer>> entrySet = hashMap.entrySet();
        List<Map.Entry<String, Integer>> list = new ArrayList<>(hashMap.entrySet());
        Collections.sort(list, new Comparator<Map.Entry<String, Integer>>(){
            @Override
            public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2)
            {
                return o1.getValue().compareTo(o2.getValue());
            }
        });
        List<Map.Entry<String, Integer>> sList = new ArrayList<>();
        for (Map.Entry s : list){
            sList = list;
        }
        return minString + "Min Key is: " + sList.get(0).getKey() + ", Min Value is: " + sList.get(0).getValue();
	}
	
	
}

示例：

public class HashMapSort {

	public static void main(String args[]) {
		HashMap<String, Integer> hashMap = new HashMap<>();
		hashMap.put("Chinese", 100);
		hashMap.put("Math", 110);
		hashMap.put("English", 90);
		hashMap.put("Phyciscs", 75);
		hashMap.put("Chemistry", 80);
		
		System.out.println(SortHashMap.getInstance().getMax(hashMap));
		System.out.println(SortHashMap.getInstance().getMin(hashMap));

	}
	
}

结果如下：

Max Key is: Math, Max Value is: 110
Min Key is: Phyciscs, Min Value is: 75