题解 | #删除字符串中出现次数最少的字符#

import java.util.*;


// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextLine()){
            Map<Character,Integer> countMap = new HashMap<>();
            String inStr = sc.nextLine();
            //计算出现次数
            for (int i = 0;i<inStr.length();i++){
                char c = inStr.charAt(i);
                if (countMap.containsKey(c)) {
                    countMap.put(c ,countMap.get(c) + 1);
                } else {
                    countMap.put(c, 1);
                }
            }
            //获取最小值
            Integer minSum = inStr.length();
            for(Character key : countMap.keySet()){
                if(countMap.get(key) < minSum){
                    minSum = countMap.get(key);
                }
            }
            //重组字符串
            StringBuffer strBuff = new StringBuffer();
            for(int i = 0;i<inStr.length();i++){
                char c = inStr.charAt(i);
                if(countMap.get(c) > minSum){
                    strBuff.append(c);
                }
            }
            System.out.println(strBuff.toString());
        }
    }
}