백준 알고리즘/그리디 알고리즘
백준 1120번 C++
paysmile
2019. 8. 28. 02:35
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
const int MAX = 51;
string a, b;
int mindiff(int k) {
int answer = 0;
for (int i = 0; i < a.length(); i++) {
if (b[i + k] != a[i])
answer++;
}
return answer;
}
int main(void) {
int diff = 987654321;
cin >> a >> b;
for (int i = (b.length() - a.length()); i >= 0; i--) {
diff = min(diff,mindiff(i));
}
cout << diff << endl;
return 0;
}