1 mport java.util.Collection;2 Importjava.util.Collections;3 ImportJava.util.HashMap;4 ImportJava.util.Map;5 ImportJava.util.Scanner;6 7 8 Public classMain9 {Ten One Public Static voidMain (string[] args) A{//abcdabcddd -StringBuilder res =NewStringBuilder (256); -Scanner sc =NewScanner (system.in); theString input =sc.nextline (); - - if(Input.length () > 20)return ; -Hashmap<character, integer> map =NewHashmap<character, integer>(); + //Count character times - Char[] CHS =Input.tochararray (); + for(CharCh:chs) A { at if(!map.containskey (CH)) - { -Map.put (ch,1); - } - Else - { inMap.put (Ch,map.get (CH) +1); - } to } + - intMin =collections.min (Map.values ()); the //Delete * for(CharCh:chs) $ {Panax Notoginseng if(min! =map.get (CH)) - res.append (CH); the } + A the System.out.println (res.tostring ()); + - } $ $}
Delete characters with the fewest occurrences in a string