PAT 甲级 1092 To Buy or Not to Buy

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

思路

这题还是很简单的，借助计数的思想就很简单。因为本题只涉及$[a,z],[A,Z],[0,9]$，这些字符的ascii码都不超过256 。故只需要一个256长度的计数数组。遍历一遍第一个字符串，将遇到的字符都加1。再遍历一遍第二个字符串，将遇到的字符都减1 。这样如果这个数组中有负数的出现，说明是第二个字符串中含有的但是第一个字符串中没有的，将负数变成正数加起来便是缺失的字符串个数了。如果都大于等于0，说明不缺少任何字符。这时俩个字符串的长度差值便是额外需要买的了。

AC代码

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <queue>
#include <stack>

#define INT_MAX 2147483647

using namespace std;

int counts[256] = { 0 };//计数数组

int main() {
	string s1, s2;
	cin >> s1 >> s2;
	for (int i = 0; i < s1.length(); i++) {
		counts[s1[i]]++;
	}
	for (int i = 0; i < s2.length(); i++) {
		counts[s2[i]]--;
	}
	int flag = 0;
	for (int i = 0; i < 256; i++) {
		if (counts[i] < 0) {
			flag -= counts[i];//记录缺失的字符个数
		}
	}
	if (flag == 0) {
		cout << "Yes " << s1.length() - s2.length();
	}
	else {
		cout << "No " << flag;
	}

	system("pause");
}