1167. Anagrammatic Distanc (字符串匹配)

暴力....

#include <iostream>#include <string>#include <algorithm>using namespace std;int main(){int t;string s1,s2;cin>>t;cin.get();  for(int l=1;l<=t;l++){string a,b;getline(cin,s1);  getline(cin,s2);if(s1.length()>=s2.length()){a=s1;b=s2;}else {a=s2;b=s1;}int count=0;cout<<"Case #"<<l<<":  ";for(int i=0;i<b.length();i++){if(a.find(b[i])!=string::npos)a.erase(a.find(b[i]),1);else count++;}cout<<count+a.length()<<endl;}return 0;}