style: format code and docs with prettier

Author: yanglbme

solution/0500-0599/0530.Minimum Absolute Difference in BST/README.md

@@ -270,24 +270,24 @@ impl Solution {
  * }
  */
 function getMinimumDifference(root: TreeNode | null): number {
-    if (!root) return 0
-  
-    let prev = Number.MIN_SAFE_INTEGER
-    let min = Number.MAX_SAFE_INTEGER
-  
+    if (!root) return 0;
+
+    let prev = Number.MIN_SAFE_INTEGER;
+    let min = Number.MAX_SAFE_INTEGER;
+
     const dfs = (node: TreeNode | null) => {
-      if (!node) return
-  
-      dfs(node.left)
-      min = Math.min(min, node.val - prev)
-      prev = node.val
-      dfs(node.right)
-    }
-  
-    dfs(root)
-  
-    return min
-  }
+        if (!node) return;
+
+        dfs(node.left);
+        min = Math.min(min, node.val - prev);
+        prev = node.val;
+        dfs(node.right);
+    };
+
+    dfs(root);
+
+    return min;
+}
 ```
 
 <!-- tabs:end -->

solution/0500-0599/0530.Minimum Absolute Difference in BST/README_EN.md

@@ -263,24 +263,24 @@ impl Solution {
  * }
  */
 function getMinimumDifference(root: TreeNode | null): number {
-    if (!root) return 0
-  
-    let prev = Number.MIN_SAFE_INTEGER
-    let min = Number.MAX_SAFE_INTEGER
-  
+    if (!root) return 0;
+
+    let prev = Number.MIN_SAFE_INTEGER;
+    let min = Number.MAX_SAFE_INTEGER;
+
     const dfs = (node: TreeNode | null) => {
-      if (!node) return
-  
-      dfs(node.left)
-      min = Math.min(min, node.val - prev)
-      prev = node.val
-      dfs(node.right)
-    }
-  
-    dfs(root)
-  
-    return min
-  }
+        if (!node) return;
+
+        dfs(node.left);
+        min = Math.min(min, node.val - prev);
+        prev = node.val;
+        dfs(node.right);
+    };
+
+    dfs(root);
+
+    return min;
+}
 ```
 
 <!-- tabs:end -->

solution/0500-0599/0530.Minimum Absolute Difference in BST/Solution.ts

@@ -12,21 +12,21 @@
  * }
  */
 function getMinimumDifference(root: TreeNode | null): number {
-    if (!root) return 0
-  
-    let prev = Number.MIN_SAFE_INTEGER
-    let min = Number.MAX_SAFE_INTEGER
-  
+    if (!root) return 0;
+
+    let prev = Number.MIN_SAFE_INTEGER;
+    let min = Number.MAX_SAFE_INTEGER;
+
     const dfs = (node: TreeNode | null) => {
-      if (!node) return
-  
-      dfs(node.left)
-      min = Math.min(min, node.val - prev)
-      prev = node.val
-      dfs(node.right)
-    }
-  
-    dfs(root)
-  
-    return min
-  }
+        if (!node) return;
+
+        dfs(node.left);
+        min = Math.min(min, node.val - prev);
+        prev = node.val;
+        dfs(node.right);
+    };
+
+    dfs(root);
+
+    return min;
+}