神州数码：输入一个字符串: (1)输出出现次数最少的字符 (2)删除出现次数最少的字符并输出字符串

//神州数码：输入一个字符串:
//(1)输出出现次数最少的字符
//(2)删除出现次数最少的字符并输出字符串
import java.util.Collection;
import java.util.Collections;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Scanner;
public class LianXi {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()){
            String str= sc.nextLine();
            char[] ch = str.toCharArray();
            method(ch);
        }
    }
    public static void method(char[] ch){
        //建立map集合，并把每个值及对应次数存进去
        Map<Character,Integer> map = new LinkedHashMap<>();
        for(char c:ch){
          if(map.containsKey(c)){
              map.put(c,map.get(c)+1);
          }else map.put(c,1);
        }
        //将value存入collection集合，找到最小value
        Collection<Integer> col = map.values();
        int min = Collections.min(col); //集合工具类Collections
        StringBuffer sb = new StringBuffer();
        for(char c:ch){
            if(map.get(c)!=min){       //将不等于最小value的key存入StringBuffer
                sb.append(c);
            }else if(map.get(c)==min){ //将等于最小value的key输出
                System.out.println(c);
            }
        }
        //StringBuffer转成String并输出
        String str = sb.toString();
        System.out.println(str);
    }
}