Commit e4ede15

committed

Update 0072.编辑距离 C语言版本

1 parent f438788 commit e4ede15Copy full SHA for e4ede15

File tree

+25

-0

lines changed

+25

-0

lines changed

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -362,7 +362,32 @@ function minDistance(word1: string, word2: string): number {`
`362`	`362`	`};`
`363`	`363`	```
`364`	`364`
	`365`	`+C:`
`365`	`366`
	`367`	+```c
	`368`	`+int min(int num1, int num2, int num3) {`
	`369`	`+ return num1 > num2 ? (num2 > num3 ? num3 : num2) : (num1 > num3 ? num3 : num1);`
	`370`	`+}`
	`371`	`+`
	`372`	`+int minDistance(char * word1, char * word2){`
	`373`	`+ int dp[strlen(word1)+1][strlen(word2)+1];`
	`374`	`+ dp[0][0] = 0;`
	`375`	`+ for (int i = 1; i <= strlen(word1); i++) dp[i][0] = i;`
	`376`	`+ for (int i = 1; i <= strlen(word2); i++) dp[0][i] = i;`
	`377`	`+`
	`378`	`+ for (int i = 1; i <= strlen(word1); i++) {`
	`379`	`+ for (int j = 1; j <= strlen(word2); j++) {`
	`380`	`+ if (word1[i-1] == word2[j-1]) {`
	`381`	`+ dp[i][j] = dp[i-1][j-1];`
	`382`	`+ }`
	`383`	`+ else {`
	`384`	`+ dp[i][j] = min(dp[i-1][j-1], dp[i][j-1], dp[i-1][j]) + 1;`
	`385`	`+ }`
	`386`	`+ }`
	`387`	`+ }`
	`388`	`+ return dp[strlen(word1)][strlen(word2)];`
	`389`	`+}`
	`390`	+```
`366`	`391`
`367`	`392`	`-----------------------`
`368`	`393`	`<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>`

Comments

(0)