Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of beads. However the owner of the shop would only sell the strings in whole pieces. Hence Eva must check whether a string in the shop contains all the beads she needs. She now comes to you for help: if the answer is Yes, please tell her the number of extra beads she has to buy; or if the answer is No, please tell her the number of beads missing from the string.
For the sake of simplicity, let’s use the characters in the ranges [0-9], [a-z], and [A-Z] to represent the colors. For example, the 3rd string in Figure 1 is the one that Eva would like to make. Then the 1st string is okay since it contains all the necessary beads with 8 extra ones; yet the 2nd one is not since there is no black bead and one less red bead.
Figure 1
Input Specification:
Each input file contains one test case. Each case gives in two lines the strings of no more than 1000 beads which belong to the shop owner and Eva, respectively.
Output Specification:
For each test case, print your answer in one line. If the answer is Yes, then also output the number of extra beads Eva has to buy; or if the answer is No, then also output the number of beads missing from the string. There must be exactly 1 space between the answer and the number.
Sample Input 1:
ppRYYGrrYBR2258
YrR8RrY
Sample Output 1:
Yes 8
Sample Input 2:
ppRYYGrrYB225
YrR8RrY
Sample Output 2:
No 2
题⽬⼤意:
⼩红想买些珠⼦做⼀串⾃⼰喜欢的珠串。卖珠⼦的摊主有很多串五颜六⾊的珠串,但是不肯把任何⼀串拆散了卖。于是⼩红要你帮忙判断⼀下,某串珠⼦⾥是否包含了全部⾃⼰想要的珠⼦?如果是,那么告诉她有多少多余的珠⼦;如果不是,那么告诉她缺了多少珠⼦
分析:
字符串str1和str2分别存储摊主的珠串和⼩红想做的珠串,遍历字符串a,将每⼀个字符出现的次数保存在shop数组中,表示摊主的每个珠⼦的个数,遍历字符串str2,如果shop[str2]>0,表示⼩红要的珠⼦摊主有,则shop[str2[i]]-1,将这个珠⼦给⼩红,否则说明⼩红要的珠⼦摊主没有,则将统计缺了多少珠⼦的missing++,如果missing不等于0,说明缺珠⼦,则不可以买,输出No以及缺了的珠⼦个数missing,否则说明不缺珠⼦,可以买,输出Yes以及摊主珠⼦多余的个数extra
代码:[hash散列]
//1092 To Buy or Not to Buy (20分)
#include <iostream>
#include <string>
using namespace std;
int shop[256];
int need[256];
int main()
{
string str1,str2;
int extra=0,missing=0;
cin>>str1>>str2;
for(int i=0;i<str1.size();i++)
{
shop[str1[i]]++;
}
for(int i=0;i<str2.size();i++)
{
if(shop[str2[i]]>0)
shop[str2[i]]--;
else
missing++;
}
for(int i=0;i<256;i++)
{
extra+=shop[i];
}
if(missing==0)
cout<<"Yes "<<extra<<endl;
else
cout<<"No "<<missing<<endl;
return 0;
}