帮帮我，关注！想了半天了

#include <bits/stdc++.h>
using namespace std;
string a, b;
int la, lb, dp[10001][10001];
int main() {
	cin >> a >> b;
	a = " " + a, b = " " + b;
	la = a.size(), lb = b .size();
	for (int i = 1; i <= la; i++) {//处理 a 的边界条件
		dp[i][1] = i;
	}
	for (int i = 1; i <= lb; i++) {//处理 b 的边界条件
		dp[1][i] = i;
	}
	for (int i = 1; i <= la; i++) {
		for (int j = 1; j <= lb; j++) {
			if(a[i] == b[j]) dp[i][j] = dp[i - 1][j - 1];
			else dp[i][j] = min(dp[i - 1][j - 1], min(dp[i - 1][j], dp[i][j - 1])) + 1;
		}
	}
	cout << dp[la][lb] << '\n';
	return 0;
}