package oj.test;
import java.util.Iterator;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;
public class Demo2 {
/**
* @删除字符串中出现次数最少的字符
* 实现删除字符串中出现次数最少的字符,若多个字符出现次数一样,则都删除。输出删除这些单词后的字符串,
* 字符串中其它字符保持原来的顺序。
虽然做出来了,但是感觉好复杂啊啊啊啊啊
*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
charCount(str);
}
public static void charCount(String str){
char[] chs = str.toCharArray();
TreeMap<Character,Integer> tm = new TreeMap<Character,Integer>();
int count =0;
for(int x =0;x<chs.length;x++){
Integer value = tm.get(chs[x]);
if(value!=null)
count = value;
count++;
tm.put(chs[x], count);
count = 0;
}
Set<Map.Entry<Character, Integer>> entrySet = tm.entrySet();
Iterator<Map.Entry<Character, Integer>> it1 = entrySet.iterator();
int min =20;
while(it1.hasNext()){
Map.Entry<Character, Integer> me = it1.next();
Integer value = me.getValue();
if(min>value)
min = value;
}
//得到了出现最少的次数
//System.out.println(min);
Iterator<Map.Entry<Character, Integer>> it2 = entrySet.iterator();
String temp ="";
while(it2.hasNext()){
Map.Entry<Character, Integer> me = it2.next();
Integer value = me.getValue();
Character key = me.getKey();
if(value == min)
temp = temp+key;
}
//得到了出现最少次数的字符
//System.out.println(temp);
for(int i = 0;i<temp.length();i++){
String[] arr = str.split(temp.charAt(i)+"");
str = "";
for(String x:arr)
str = str+x;
}
System.out.println(str);
}
}