int main()
{
char arr[20] = { 0 };
char hash[26] = { 0 };
gets(arr);
int len = strlen(arr);
int i = 0, asc = 0, min = 999;
for (i; i < len; i++)
{
asc = (int)arr[i];//将每个字符映射到对应的哈希表中,并记录下该字符出现的次数
hash[asc-97]++;
}
for (int j = 0; j < 26; j++)//循环遍历,得出min
{
if (hash[j] > 0 && hash[j] <= min)
{
min = hash[j];
}
}
for (int k = 0; k < len; k++)
{
if (hash[(int)arr[k]-97] != min)//字符未映射到次数最小的字符,就会输出;反之就会跳过这次循环
{
printf("%c", arr[k]);
}
else
continue;
}
return 0;
}