diff --git "a/problems/0583.\344\270\244\344\270\252\345\255\227\347\254\246\344\270\262\347\232\204\345\210\240\351\231\244\346\223\215\344\275\234.md" "b/problems/0583.\344\270\244\344\270\252\345\255\227\347\254\246\344\270\262\347\232\204\345\210\240\351\231\244\346\223\215\344\275\234.md"
index d476c95a4d..9aef2310ca 100644
--- "a/problems/0583.\344\270\244\344\270\252\345\255\227\347\254\246\344\270\262\347\232\204\345\210\240\351\231\244\346\223\215\344\275\234.md"
+++ "b/problems/0583.\344\270\244\344\270\252\345\255\227\347\254\246\344\270\262\347\232\204\345\210\240\351\231\244\346\223\215\344\275\234.md"
@@ -149,6 +149,32 @@ class Solution:
 Go：
 
 
+Javascript：
+```javascript
+const minDistance = (word1, word2) => {
+    let dp = Array.from(Array(word1.length + 1), () => Array(word2.length+1).fill(0));
+
+    for(let i = 1; i <= word1.length; i++) {
+        dp[i][0] = i; 
+    }
+
+    for(let j = 1; j <= word2.length; j++) {
+        dp[0][j] = j;
+    }
+
+    for(let i = 1; i <= word1.length; i++) {
+        for(let j = 1; j <= word2.length; j++) {
+            if(word1[i-1] === word2[j-1]) {
+                dp[i][j] = dp[i-1][j-1];
+            } else {
+                dp[i][j] = Math.min(dp[i-1][j] + 1, dp[i][j-1] + 1, dp[i-1][j-1] + 2);
+            }
+        }
+    }
+    
+    return dp[word1.length][word2.length];
+};
+```
 
 
 -----------------------