PAT (Advanced) 1092. To Buy or Not to Buy (20)

原题：1092. To Buy or Not to Buy (20)

解题思路：

建一个记录所要的所有字符出现次数的向量，再与给出的字符串进行比对即可。

代码如下：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
const int maxn = 256;
int h[maxn];

int main()
{
    string s1, s2;
    while(cin >> s1 >> s2)
    {
        fill(h, h+maxn, 0);
        for(int i = 0; i < s2.size(); i++)
            h[s2[i]]++;
        for(int i = 0; i < s1.size(); i++)
            if(h[s1[i]] > 0) h[s1[i]]--;
        int flag = 0; //在无法满足时，直接记录缺额
        for(int i = 0; i < maxn; i++)
            if(h[i] > 0) flag += h[i];

        if(!flag)
            printf("Yes %d\n", s1.size() - s2.size());
        else
            printf("No %d\n", flag);
    }
    return 0;
}