mirror of
https://gitcode.com/Zengtudor/alg2025.git
synced 2025-09-05 17:50:36 +00:00
19 lines
252 B
C++
19 lines
252 B
C++
/*
|
|
|
|
dp[i][j]=源串前i个字符匹配目标串前j个字符所需要的最小操作次数
|
|
|
|
如果第i个字符==第j个字符
|
|
dp[i][j]=dp[i-1][j-1]
|
|
如果不相等
|
|
dp[i][j]=min{
|
|
dp[i-1][j],
|
|
dp[i][j-1],
|
|
dp[i-1][j-1]
|
|
}+1
|
|
|
|
*/
|
|
|
|
|
|
int main(){
|
|
|
|
} |