输入:长度不超过20的字符串,且都是小写输入 删除出现次数最少的字符 若最少次数的不止一个字符,则都删除
输出:按原来字符串的顺序删除后输出
例:输入:abcdd
输出:dd
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
struct zifu
{
int count;
char a;
};
bool cmp(zifu a, zifu b)
{
return a.count < b.count;
}
int main()
{
zifu all_str[20];
int j = 0;
string str;
cin >> str;
int length = str.size();
map<char, int>m;
map<char, int>::iterator p2;
for (int i = 0;i < length;i++)
{
m[str[i]]++;
}
for (p2 = m.begin();p2 != m.end();p2++)
{
all_str[j].a = p2->first;
all_str[j].count = p2->second;
j++;
}
vector<char>vec;
vector<char>::iterator p;
sort(all_str,all_str+j,cmp);
for (int i = 0;i < j;i++)
{
if(all_str[i].count == all_str[0].count)
vec.push_back(all_str[i].a);
}
for (int i = 0;i < length;i++)
{
int flag = 0;
for (p = vec.begin();p != vec.end();p++)
{
if (str[i] == *p)flag = 1;
}
if (!flag)
cout << str[i];
}
return 0;
}
算法竞赛入门指南里说过,所谓删除就是输出不出现,只要找到它们,输出的时候不输出这些即可。