我是靠谱客的博主 殷勤百褶裙,最近开发中收集的这篇文章主要介绍PAT 1092 To Buy or Not to Buy(字符串处理),觉得挺不错的,现在分享给大家,希望可以做个参考。

概述

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

 总结:这道题目在乙级写过,就是简单的字符串处理问题,还行

代码:

#include <iostream>
using namespace std;

int a[128],b[128];
int main(){
    string s,t;
    cin >> s >> t;
    
    int cot=0;
    bool flag=false;
    for(auto c:s)   a[c]++;
    for(auto c:t){
        a[c]--;
        if(a[c]<0){
            flag=true;
            cot++;
        }
    }
    if(flag)    printf("No %dn",cot);
    else printf("Yes %dn",s.size()-t.size());
    
    return 0;
}

好好学习,天天向上!

我要考研!

最后

以上就是殷勤百褶裙为你收集整理的PAT 1092 To Buy or Not to Buy(字符串处理)的全部内容,希望文章能够帮你解决PAT 1092 To Buy or Not to Buy(字符串处理)所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错,欢迎将靠谱客网站推荐给程序员好友。

本图文内容来源于网友提供,作为学习参考使用,或来自网络收集整理,版权属于原作者所有。
点赞(35)

评论列表共有 0 条评论

立即
投稿
返回
顶部