PAT甲級 1092 To Buy or Not to Buy (20 分)(模擬)

題目鏈接：https://pintia.cn/problem-sets/994805342720868352/problems/994805374509498368

思路：直接用數組記錄出現次數判斷即可。

代碼：

#include <bits/stdc++.h>

using namespace std;

int vis[300];


int main() {
	string s1 , s2;
	cin >> s1 >> s2;
	int i;
	for(i = 0 ; i < s1.length() ; i++) {
		vis[s1[i]]++;
	}
	bool flag = 0;
	int cnt = 0;
	for(i = 0 ; i < s2.length() ; i++) {
		if(vis[s2[i]]) {
			vis[s2[i]]--;
			cnt++;
		}
		else {
			flag = 1;
		}
	}
	if(flag) {
		cout << "No "<<s2.length() - cnt << "\n";
	}
	else {
		cout << "Yes "<<abs(s1.length() - s2.length()) << "\n";
	}
	return 0;
}