add js problems

Author: 2xiao

assets/output/0098.md

@@ -9,87 +9,65 @@ tree (BST)_.
 
 A **valid BST** is defined as follows:
 
-  * The left subtree of a node contains only nodes with keys **less than** the node's key.
-  * The right subtree of a node contains only nodes with keys **greater than** the node's key.
-  * Both the left and right subtrees must also be binary search trees.
-
-
+- The left subtree of a node contains only nodes with keys **less than** the node's key.
+- The right subtree of a node contains only nodes with keys **greater than** the node's key.
+- Both the left and right subtrees must also be binary search trees.
 
 **Example 1:**
 
 ![](https://assets.leetcode.com/uploads/2020/12/01/tree1.jpg)
 
 > Input: root = [2,1,3]
-> 
+>
 > Output: true
 
 **Example 2:**
 
 ![](https://assets.leetcode.com/uploads/2020/12/01/tree2.jpg)
 
 > Input: root = [5,1,4,null,null,3,6]
-> 
+>
 > Output: false
-> 
+>
 > Explanation: The root node's value is 5 but its right child's value is 4.
 
 **Constraints:**
 
-  * The number of nodes in the tree is in the range `[1, 104]`.
-  * `-231 <= Node.val <= 231 - 1`
-
+- The number of nodes in the tree is in the range `[1, 10^4]`.
+- `-231 <= Node.val <= 231 - 1`
 
 ## 题目大意
 
 给你一个二叉树的根节点 `root` ，判断其是否是一个有效的二叉搜索树。
 
 **有效** 二叉搜索树定义如下：
 
-  * 节点的左子树只包含**小于** 当前节点的数。
-  * 节点的右子树只包含 **大于** 当前节点的数。
-  * 所有左子树和右子树自身必须也是二叉搜索树。
-
-
+- 节点的左子树只包含**小于** 当前节点的数。
+- 节点的右子树只包含 **大于** 当前节点的数。
+- 所有左子树和右子树自身必须也是二叉搜索树。
 
 **示例 1：**
 
 ![](https://assets.leetcode.com/uploads/2020/12/01/tree1.jpg)
 
-> 
-> 
-> 
-> 
-> 
 > **输入：** root = [2,1,3]
-> 
+>
 > **输出：** true
-> 
-> 
 
 **示例 2：**
 
 ![](https://assets.leetcode.com/uploads/2020/12/01/tree2.jpg)
 
-> 
-> 
-> 
-> 
-> 
 > **输入：** root = [5,1,4,null,null,3,6]
-> 
+>
 > **输出：** false
-> 
+>
 > **解释：** 根节点的值是 5 ，但是右子节点的值是 4 。
-> 
-> 
-
-
 
 **提示：**
 
-  * 树中节点数目范围在`[1, 104]` 内
-  * `-231 <= Node.val <= 231 - 1`
-
+- 树中节点数目范围在`[1, 10^4]` 内
+- `-231 <= Node.val <= 231 - 1`
 
 ## 解题思路
 

assets/output/0104.md

@@ -6,76 +6,52 @@
 
 Given the `root` of a binary tree, return _its maximum depth_.
 
-A binary tree's **maximum depth**  is the number of nodes along the longest
+A binary tree's **maximum depth** is the number of nodes along the longest
 path from the root node down to the farthest leaf node.
 
-
-
 **Example 1:**
 
 ![](https://assets.leetcode.com/uploads/2020/11/26/tmp-tree.jpg)
 
 > Input: root = [3,9,20,null,null,15,7]
-> 
+>
 > Output: 3
 
 **Example 2:**
 
 > Input: root = [1,null,2]
-> 
+>
 > Output: 2
 
 **Constraints:**
 
-  * The number of nodes in the tree is in the range `[0, 104]`.
-  * `-100 <= Node.val <= 100`
-
+- The number of nodes in the tree is in the range `[0, 10^4]`.
+- `-100 <= Node.val <= 100`
 
 ## 题目大意
 
 给定一个二叉树 `root` ，返回其最大深度。
 
 二叉树的 **最大深度** 是指从根节点到最远叶子节点的最长路径上的节点数。
 
-
-
 **示例 1：**
 
 ![](https://assets.leetcode.com/uploads/2020/11/26/tmp-tree.jpg)
 
-
-
-> 
-> 
-> 
-> 
-> 
 > **输入：** root = [3,9,20,null,null,15,7]
-> 
+>
 > **输出：** 3
-> 
-> 
 
 **示例 2：**
 
-> 
-> 
-> 
-> 
-> 
 > **输入：** root = [1,null,2]
-> 
+>
 > **输出：** 2
-> 
-> 
-
-
 
 **提示：**
 
-  * 树中节点的数量在 `[0, 104]` 区间内。
-  * `-100 <= Node.val <= 100`
-
+- 树中节点的数量在 `[0, 10^4]` 区间内。
+- `-100 <= Node.val <= 100`
 
 ## 解题思路
 

assets/output/0109.md

@@ -8,73 +8,51 @@ Given the `head` of a singly linked list where elements are sorted in
 **ascending order** , convert _it to a_** _height-balanced_** _binary search
 tree_.
 
-
-
 **Example 1:**
 
 ![](https://assets.leetcode.com/uploads/2020/08/17/linked.jpg)
 
 > Input: head = [-10,-3,0,5,9]
-> 
+>
 > Output: [0,-3,9,-10,null,5]
-> 
+>
 > Explanation: One possible answer is [0,-3,9,-10,null,5], which represents the shown height balanced BST.
 
 **Example 2:**
 
 > Input: head = []
-> 
+>
 > Output: []
 
 **Constraints:**
 
-  * The number of nodes in `head` is in the range `[0, 2 * 104]`.
-  * `-10^5 <= Node.val <= 10^5`
-
+- The number of nodes in `head` is in the range `[0, 2 * 10^4]`.
+- `-10^5 <= Node.val <= 10^5`
 
 ## 题目大意
 
-给定一个单链表的头节点  `head` ，其中的元素 **按升序排序** ，将其转换为 平衡 二叉搜索树。
-
-
+给定一个单链表的头节点 `head` ，其中的元素 **按升序排序** ，将其转换为 平衡 二叉搜索树。
 
 **示例 1:**
 
 ![](https://assets.leetcode.com/uploads/2020/08/17/linked.jpg)
 
-> 
-> 
-> 
-> 
-> 
 > **输入:** head = [-10,-3,0,5,9]
-> 
+>
 > **输出:** [0,-3,9,-10,null,5]
-> 
+>
 > **解释:** 一个可能的答案是[0，-3,9，-10,null,5]，它表示所示的高度平衡的二叉搜索树。
-> 
-> 
 
 **示例 2:**
 
-> 
-> 
-> 
-> 
-> 
 > **输入:** head = []
-> 
+>
 > **输出:** []
-> 
-> 
-
-
 
 **提示:**
 
-  * `head` 中的节点数在`[0, 2 * 104]` 范围内
-  * `-10^5 <= Node.val <= 10^5`
-
+- `head` 中的节点数在`[0, 2 * 10^4]` 范围内
+- `-10^5 <= Node.val <= 10^5`
 
 ## 解题思路
 

assets/output/0111.md

@@ -9,29 +9,26 @@ Given a binary tree, find its minimum depth.
 The minimum depth is the number of nodes along the shortest path from the root
 node down to the nearest leaf node.
 
-**Note:**  A leaf is a node with no children.
-
-
+**Note:** A leaf is a node with no children.
 
 **Example 1:**
 
 ![](https://assets.leetcode.com/uploads/2020/10/12/ex_depth.jpg)
 
 > Input: root = [3,9,20,null,null,15,7]
-> 
+>
 > Output: 2
 
 **Example 2:**
 
 > Input: root = [2,null,3,null,4,null,5,null,6]
-> 
+>
 > Output: 5
 
 **Constraints:**
 
-  * The number of nodes in the tree is in the range `[0, 105]`.
-  * `-1000 <= Node.val <= 1000`
-
+- The number of nodes in the tree is in the range `[0, 10^5]`.
+- `-1000 <= Node.val <= 1000`
 
 ## 题目大意
 
@@ -45,35 +42,20 @@ node down to the nearest leaf node.
 
 ![](https://assets.leetcode.com/uploads/2020/10/12/ex_depth.jpg)
 
-> 
-> 
-> 
-> 
-> 
 > **输入：** root = [3,9,20,null,null,15,7]
-> 
+>
 > **输出：** 2
-> 
-> 
 
 **示例 2：**
 
-> 
-> 
-> 
-> 
-> 
 > **输入：** root = [2,null,3,null,4,null,5,null,6]
-> 
+>
 > **输出：** 5
-> 
-> 
 
 **提示：**
 
-  * 树中节点数的范围在 `[0, 105]` 内
-  * `-1000 <= Node.val <= 1000`
-
+- 树中节点数的范围在 `[0, 10^5]` 内
+- `-1000 <= Node.val <= 1000`
 
 ## 解题思路