【PAT甲级 - C++题解】1092 To Buy or Not to Buy

最新推荐文章于 2025-09-24 00:11:20 发布

原创最新推荐文章于 2025-09-24 00:11:20 发布 · 1k 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#c++ #算法 #PAT #数据结构 #模拟

PAT甲级真题专栏收录该内容

154 篇文章

订阅专栏

本文提供了一道典型的PAT甲级编程题的详细解答过程。题目要求根据给定的两个字符串，判断目标字符串中的字符是否能在源字符串中找到，并计算多余或缺少的字符数量。文章通过哈希表的方法实现了高效求解。

✍个人博客：https://blog.csdn.net/Newin2020?spm=1011.2415.3001.5343
📚专栏地址：PAT题解集合
📝原题地址：题目详情 - 1092 To Buy or Not to Buy (pintia.cn)
🔑中文翻译：买还是不买
📣专栏定位：为想考甲级PAT的小伙伴整理常考算法题解，祝大家都能取得满分！
❤️如果有收获的话，欢迎点赞👍收藏📁，您的支持就是我创作的最大动力💪

1092 To Buy or Not to Buy

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

题意

给定一个源串和一个目标串，判断目标串中的字符是否都能在源串中找到，如果都能找到则输出 Yes 并接着输出源串中多余的字符数量，否则输出 No 并接着输出目标串中缺少的字符数量。

思路

思路如下：

输入源串和目标串，并用哈希表来存储两个字符串中字符相差的数量，源串中的每个字符在哈希表中数量增加，而目标串中的每个字符在哈希表中数量减少。
计算给定字符串中多余字符以及缺少字符的数量，如果哈希表对应的字符数量是正数，则说明该字符在源串中是多余的；如果是负数，则说明该字符在源串中是缺少的。
如果缺少字符的数量大于 0 ，则输出 No 以及缺少字符数量；反之，输出 Yes 以及多余字符数量。

代码

#include<bits/stdc++.h>
using namespace std;

int main()
{
    //输入源串和目标串
    string a, b;
    cin >> a >> b;

    //统计源串和目标串的各颜色数量
    unordered_map<char, int> cnt;
    for (auto& s : a)  cnt[s]++;
    for (auto& p : b)  cnt[p]--;

    //计算多余或缺少的颜色数量
    int ns = 0, np = 0;
    for (auto& n : cnt)
    {
        if (n.second > 0)  ns += n.second;
        else np -= n.second;
    }

    //输出统计结果
    if (np)  cout << "No " << np << endl;
    else    cout << "Yes " << ns << endl;

    return 0;
}