PAT-A1092/B1039 To Buy or Not to Buy/到底买不买题目内容及题解

最新推荐文章于 2022-12-11 08:45:55 发布

Bourbon_Whiskey_

最新推荐文章于 2022-12-11 08:45:55 发布

阅读量276

点赞数

分类专栏： PAT甲级 PAT乙级文章标签： PAT 甲级乙级 OJ 编程学习

本文链接：https://blog.csdn.net/Bourbon_Whiskey_/article/details/86769568

版权

PAT甲级同时被 2 个专栏收录

156 篇文章 3 订阅

订阅专栏

PAT乙级

33 篇文章 0 订阅

订阅专栏

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.

小红想买些珠子做一串自己喜欢的珠串。卖珠子的摊主有很多串五颜六色的珠串，但是不肯把任何一串拆散了卖。于是小红要你帮忙判断一下，某串珠子里是否包含了全部自己想要的珠子？如果是，那么告诉她有多少多余的珠子；如果不是，那么告诉她缺了多少珠子。

为方便起见，我们用[0-9]、[a-z]、[A-Z]范围内的字符来表示颜色。例如在图1中，第3串是小红想做的珠串；那么第1串可以买，因为包含了全部她想要的珠子，还多了8颗不需要的珠子；第2串不能买，因为没有黑色珠子，并且少了一颗红色的珠子。

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.

每个输入包含 1 个测试用例。每个测试用例分别在 2 行中先后给出摊主的珠串和小红想做的珠串，两串都不超过 1000 个珠子。

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.

如果可以买，则在一行中输出 Yes 以及有多少多余的珠子；如果不可以买，则在一行中输出 No 以及缺了多少珠子。其间以 1 个空格分隔。

Sample Input 1:

ppRYYGrrYBR2258
YrR8RrY

Sample Output 1:

Yes 8

Sample Input 2:

ppRYYGrrYB225
YrR8RrY

Sample Output 2:

No 2

解题思路

用哈希表分别存储两条链子；
对比两个哈希表并查看是否有不足的；
如有不足则再次遍历并计算少了的颗数，否则按照题目要求计算多出来的颗数；
输出结果并返回零值。

代码

#include<stdio.h>
#include<string.h>
#define maxn 1010
int HashTable[2][128];
int main(){
    char str[maxn];
    int i,len1,len2,ans;
    scanf("%s",str);
    len1=strlen(str);
    for(i=0;i<len1;i++){
        HashTable[0][str[i]]++;
    }
    scanf("%s",str);
    len2=strlen(str);
    for(i=0;i<len2;i++){
        HashTable[1][str[i]]++;
    }
    for(i=0;i<128;i++){
        if(HashTable[1][i]>HashTable[0][i]){
            break;//不够 
        }
    }
    if(i<128){
        printf("No ");
        ans=0;
        for(i=0;i<128;i++){
            ans+=((HashTable[0][i]-HashTable[1][i])<0?HashTable[0][i]-HashTable[1][i]:0);
        }
        printf("%d\n",-ans);
    }else{
        printf("Yes %d\n",len1-len2);
    }
    return 0;
}