algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1680 from chenzhg-maker/dev

Browse Source 
Update 0072.编辑距离 C语言版本
This commit is contained in:
程序员Carl
2022-10-09 10:27:34 +08:00
committed by GitHub
parent 838a4fc783 6ab8d5074e
commit 8b960f9e60
1 changed files with 2 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/0072.编辑距离.md
View File

@ -364,6 +364,7 @@ function minDistance(word1: string, word2: string): number {
C： C：
```c ```c
int min(int num1, int num2, int num3) { int min(int num1, int num2, int num3) {
return num1 > num2 ? (num2 > num3 ? num3 : num2) : (num1 > num3 ? num3 : num1); return num1 > num2 ? (num2 > num3 ? num3 : num2) : (num1 > num3 ? num3 : num1);
@ -376,7 +377,7 @@ int minDistance(char * word1, char * word2){
for (int i = 1; i <= strlen(word2); i++) dp[0][i] = i; for (int i = 1; i <= strlen(word2); i++) dp[0][i] = i;
for (int i = 1; i <= strlen(word1); i++) { for (int i = 1; i <= strlen(word1); i++) {
for (int j = 1; j <=strlen(word2); j++) { for (int j = 1; j <= strlen(word2); j++) {
if (word1[i-1] == word2[j-1]) { if (word1[i-1] == word2[j-1]) {
dp[i][j] = dp[i-1][j-1]; dp[i][j] = dp[i-1][j-1];
} }
@ -389,7 +390,5 @@ int minDistance(char * word1, char * word2){
} }
``` ```
----------------------- -----------------------
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div> <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>