1092 To Buy or Not to Buy (20 point(s))

最新推荐文章于 2023-06-07 14:07:31 发布

原创最新推荐文章于 2023-06-07 14:07:31 发布 · 176 阅读

0 ·

CC 4.0 BY-SA版权

PAT 专栏收录该内容

138 篇文章

订阅专栏

本文介绍了一种基于哈希表的算法，用于帮助Eva决定是否在商店购买整串珠子来制作她喜欢的珠串。算法通过比较Eva所需的珠子与商店提供的珠子，确定是否需要额外购买珠子或缺失的珠子数量。

1092 To Buy or Not to Buy (20 point(s))

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

简单题。哈希表求解。

#include<iostream>
#include<string>
using namespace std;
int need[256]={0};
int own[256]={0};
int main(void){
	string s1,s2;cin>>s1>>s2;
	for(int i=0;i<s2.length();i++){
		need[s2[i]]++;
	}
	for(int i=0;i<s1.length();i++){
		own[s1[i]]++;
	}
	bool flag = true;
	int extra = 0;int missing=0;
	for(int i=0;i<256;i++){
		if(own[i]>=need[i]){
			extra += (own[i]-need[i]);
		}
		else{
			missing += (need[i]-own[i]);
			flag = false;
		}
	}
	if(flag) cout<<"Yes "<<extra<<endl;
	else cout<<"No "<<missing<<endl;
	return 0;
}