From e4ca3482fbb5202172c6268a10565dfbf116f6fc Mon Sep 17 00:00:00 2001
From: chenzhg <2216468566@qq.com>
Date: Sat, 1 Oct 2022 16:25:03 +0800
Subject: [PATCH] =?UTF-8?q?Update=200072.=E7=BC=96=E8=BE=91=E8=B7=9D?=
 =?UTF-8?q?=E7=A6=BB=20=E6=B7=BB=E5=8A=A0C=E8=AF=AD=E8=A8=80=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0072.编辑距离.md | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)

diff --git a/problems/0072.编辑距离.md b/problems/0072.编辑距离.md
index e40461de..a15012d7 100644
--- a/problems/0072.编辑距离.md
+++ b/problems/0072.编辑距离.md
@@ -362,6 +362,33 @@ function minDistance(word1: string, word2: string): number {
 };
 ```
 
+C：
+
+```c
+int min(int num1, int num2, int num3) {
+    return num1 > num2 ? (num2 > num3 ? num3 : num2) : (num1 > num3 ? num3 : num1); 
+}
+
+int minDistance(char * word1, char * word2){
+    int dp[strlen(word1)+1][strlen(word2)+1];
+    dp[0][0] = 0;
+    for (int i = 1; i <= strlen(word1); i++) dp[i][0] = i;
+    for (int i = 1; i <= strlen(word2); i++) dp[0][i] = i;
+
+    for (int i = 1; i <= strlen(word1); i++) {
+        for (int j = 1; j <=strlen(word2); j++) {
+            if (word1[i-1] == word2[j-1]) {
+                dp[i][j] = dp[i-1][j-1];
+            }
+            else {
+                dp[i][j] = min(dp[i-1][j-1], dp[i][j-1], dp[i-1][j]) + 1;
+            }
+        }
+    }
+    return dp[strlen(word1)][strlen(word2)];
+}
+```
+
 
 
 -----------------------