0053 0072 0392 0583 Used 2 indents for JavaScript code.

gazeldx · gazeldx · commit cfb5e7d802f4 · 2024-12-02T10:07:26.000+08:00
diff --git a/problems/0053-maximum-subarray.md b/problems/0053-maximum-subarray.md
@@ -145,13 +145,13 @@ public class Solution {
 ## JavaScript
 ```javascript
 var maxSubArray = function(nums) {
-    const dp = [...nums]
+  const dp = [...nums]
 
-    for (let i = 1; i < dp.length; i++) {
-        dp[i] = Math.max(nums[i], dp[i - 1] + nums[i])
-    }
+  for (let i = 1; i < dp.length; i++) {
+    dp[i] = Math.max(nums[i], dp[i - 1] + nums[i])
+  }
 
-    return Math.max(...dp)
+  return Math.max(...dp)
 };
 ```
 
diff --git a/problems/0072-edit-distance.md b/problems/0072-edit-distance.md
@@ -236,23 +236,23 @@ public class Solution {
 ## JavaScript
 ```javascript
 var minDistance = function(word1, word2) {
-    const dp = Array(word1.length + 1).fill().map(
-        () => Array(word2.length + 1).fill(0)
-    )
-    dp.forEach((_, i) => { dp[i][0] = i })
-    dp[0].forEach((_, j) => { dp[0][j] = j })
-
-    for (let i = 1; i < dp.length; i++) {
-        for (let j = 1; j < dp[0].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 - 1][j], dp[i][j - 1]) + 1
-            }
-        }
+  const dp = Array(word1.length + 1).fill().map(
+    () => Array(word2.length + 1).fill(0)
+  )
+  dp.forEach((_, i) => { dp[i][0] = i })
+  dp[0].forEach((_, j) => { dp[0][j] = j })
+
+  for (let i = 1; i < dp.length; i++) {
+    for (let j = 1; j < dp[0].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 - 1][j], dp[i][j - 1]) + 1
+      }
     }
+  }
 
-    return dp.at(-1).at(-1)
+  return dp.at(-1).at(-1)
 };
 ```
 
diff --git a/problems/0392-is-subsequence.md b/problems/0392-is-subsequence.md
@@ -179,22 +179,22 @@ public class Solution {
 ## JavaScript
 ```javascript
 var isSubsequence = function(s, t) {
-    const dp = Array(s.length + 1).fill().map(
-        () => Array(t.length + 1).fill(false)
-    )
-    dp[0].fill(true)
-
-    for (let i = 1; i < dp.length; i++) {
-        for (let j = 1; j < dp[0].length; j++) {
-            if (s[i - 1] == t[j - 1]) {
-                dp[i][j] = dp[i - 1][j - 1]
-            } else {
-                dp[i][j] = dp[i][j - 1]
-            }
-        }
+  const dp = Array(s.length + 1).fill().map(
+    () => Array(t.length + 1).fill(false)
+  )
+  dp[0].fill(true)
+
+  for (let i = 1; i < dp.length; i++) {
+    for (let j = 1; j < dp[0].length; j++) {
+      if (s[i - 1] == t[j - 1]) {
+        dp[i][j] = dp[i - 1][j - 1]
+      } else {
+        dp[i][j] = dp[i][j - 1]
+      }
     }
+  }
 
-   return dp.at(-1).at(-1)
+  return dp.at(-1).at(-1)
 };
 ```
 
diff --git a/problems/0583-delete-operation-for-two-strings.md b/problems/0583-delete-operation-for-two-strings.md
@@ -191,23 +191,23 @@ public class Solution {
 ## JavaScript
 ```javascript
 var minDistance = function(word1, word2) {
-    const dp = Array(word1.length + 1).fill().map(
-        () => Array(word2.length + 1).fill(0)
-    )
-    dp.forEach((_, i) => { dp[i][0] = i })
-    dp[0].forEach((_, j) => { dp[0][j] = j })
+  const dp = Array(word1.length + 1).fill().map(
+    () => Array(word2.length + 1).fill(0)
+  )
+  dp.forEach((_, i) => { dp[i][0] = i })
+  dp[0].forEach((_, j) => { dp[0][j] = j })
 
-    for (let i = 1; i < dp.length; i++) {
-        for (let j = 1; j < dp[0].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], dp[i][j - 1]) + 1
-            }
-        }
+  for (let i = 1; i < dp.length; i++) {
+    for (let j = 1; j < dp[0].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], dp[i][j - 1]) + 1
+      }
     }
+  }
 
-    return dp.at(-1).at(-1)
+  return dp.at(-1).at(-1)
 };
 ```
 
