PAT乙级1039 到底买不买 (20 分)

it2022-05-05  164

https://pintia.cn/problem-sets/994805260223102976/problems/994805283241443328

hash表

#include <iostream> using namespace std; int main(){ string s1, s2; int s11[300] = {0}, flag = 1, cnt = 0; cin >> s1 >> s2; for(int i = 0; i < s1.size(); i++) s11[s1[i]]++; for(int i = 0; i < s2.size(); i++){ if(s11[s2[i]]) s11[s2[i]]--; else{ cnt++; flag = 0; } } if(flag) cout << "Yes " << s1.size()-s2.size(); else cout << "No " << cnt; return 0; }

最新回复(0)