To Buy or Not to Buy (20)

题目链接：https://www.nowcoder.com/pat/5/problem/4038
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 string “YrR8RrY” is the one that Eva would like
to make. Then the string “ppRYYGrrYBR2258” is okay since it
contains

all the necessary beads with 8 extra ones; yet the string
“ppRYYGrrYB225” is not since there is no black bead and one
less red bead.

输入描述:

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.

输出描述:

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.

输入例子:

ppRYYGrrYBR2258

YrR8RrY

输出例子:

Yes 8

#include <cstdio>
#include <iostream>
#include <cstring>

using namespace std;
const int LEN = 1005;

char str1[LEN], str2[LEN];
int h[62]; //0~9,a~z,A~Z

int GetHashValue(char c) {
    int ret;
    if (c >= '0' && c <= '9') {
        ret = c-'0';
    }
    else if (c >= 'a' && c <= 'z') {
        ret = c - 'a' + 10;
    }
    else {
        ret = c - 'A' + 36;
    }
    return ret;
}
void Solve() {
    memset(h,0,sizeof(h));
    scanf("%s%s", str1, str2);
    int len1 = strlen(str1);
    int len2 = strlen(str2);
    int cnt = len2; //统计不匹配时缺失的字符数
    int ret;
    for (int i = 0; str1[i]; i++) { //实现str2中字符的hash映射
        ret = GetHashValue(str1[i]);
        h[ret] ++;
    }
    //Match
    for (int i = 0; str1[i]; i++) {
        ret = GetHashValue(str2[i]);;
        if (h[ret]) {
            h[ret] --;
            cnt--;
        }
    }
    if (cnt) printf("No %d\n", cnt);
    else printf("Yes %d\n",len1-len2);
}

int main() {
    Solve();
    return 0;
}