Java计数字符串出现并按相反顺序排序

import java.util.*;

public class CountAndSortStrings {
    public static void main(String[] args) {
        String[] strings = {"apple", "banana", "apple", "orange", "banana", "apple"};
        Map<String, Integer> countMap = new HashMap<>();

        // 计算每个字符串出现的次数
        for (String str : strings) {
            countMap.put(str, countMap.getOrDefault(str, 0) + 1);
        }

        // 将Map转换为List进行排序
        List<Map.Entry<String, Integer>> entryList = new ArrayList<>(countMap.entrySet());
        Collections.sort(entryList, (a, b) -> b.getValue().compareTo(a.getValue()));

        // 输出排序结果
        for (Map.Entry<String, Integer> entry : entryList) {
            System.out.println(entry.getKey() + ": " + entry.getValue());
        }
    }
}