> 알고리즘 문제 풀이/BOJ
[Python] 1120-문자열
bky373
2020. 11. 4. 23:05
A, B = input().split()
diff = 50
for i in range(len(B)-len(A)+1):
cnt = 0
for j in range(len(A)):
if A[j] != B[j+i]:
cnt += 1
if cnt < diff:
diff = cnt
print(diff)