add 2044

Author: 2xiao

assets/output/0056.md

@@ -102,7 +102,7 @@ that cover all the intervals in the input_.
 | 616 | [给字符串添加加粗标签](https://leetcode.com/problems/add-bold-tag-in-string) |  |  [`字典树`](/leetcode/outline/tag/trie.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `2+` | <font color=#ffb800>Medium</font> |
 | 715 | [Range 模块](https://leetcode.com/problems/range-module) |  |  [`设计`](/leetcode/outline/tag/design.md) [`线段树`](/leetcode/outline/tag/segment-tree.md) [`有序集合`](/leetcode/outline/tag/ordered-set.md) | <font color=#ff334b>Hard</font> |
 | 759 | [员工空闲时间](https://leetcode.com/problems/employee-free-time) |  |  [`数组`](/leetcode/outline/tag/array.md) [`排序`](/leetcode/outline/tag/sorting.md) [`堆（优先队列）`](/leetcode/outline/tag/heap-priority-queue.md) | <font color=#ff334b>Hard</font> |
-| 763 | [划分字母区间](https://leetcode.com/problems/partition-labels) |  |  [`贪心`](/leetcode/outline/tag/greedy.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
+| 763 | [划分字母区间](https://leetcode.com/problems/partition-labels) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0763) |  [`贪心`](/leetcode/outline/tag/greedy.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
 | 986 | [区间列表的交集](https://leetcode.com/problems/interval-list-intersections) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0986) |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) | <font color=#ffb800>Medium</font> |
 | 2158 | [每天绘制新区域的数量](https://leetcode.com/problems/amount-of-new-area-painted-each-day) |  |  [`线段树`](/leetcode/outline/tag/segment-tree.md) [`数组`](/leetcode/outline/tag/array.md) [`有序集合`](/leetcode/outline/tag/ordered-set.md) | <font color=#ff334b>Hard</font> |
 | 2213 | [由单个字符重复的最长子字符串](https://leetcode.com/problems/longest-substring-of-one-repeating-character) |  |  [`线段树`](/leetcode/outline/tag/segment-tree.md) [`数组`](/leetcode/outline/tag/array.md) [`字符串`](/leetcode/outline/tag/string.md) `1+` | <font color=#ff334b>Hard</font> |

assets/output/0078.md

@@ -96,7 +96,7 @@ in **any order**.
 | 320 | [列举单词的全部缩写](https://leetcode.com/problems/generalized-abbreviation) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`字符串`](/leetcode/outline/tag/string.md) [`回溯`](/leetcode/outline/tag/backtracking.md) | <font color=#ffb800>Medium</font> |
 | 784 | [字母大小写全排列](https://leetcode.com/problems/letter-case-permutation) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`字符串`](/leetcode/outline/tag/string.md) [`回溯`](/leetcode/outline/tag/backtracking.md) | <font color=#ffb800>Medium</font> |
 | 1982 | [从子集的和还原数组](https://leetcode.com/problems/find-array-given-subset-sums) |  |  [`数组`](/leetcode/outline/tag/array.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) | <font color=#ff334b>Hard</font> |
-| 2044 | [统计按位或能得到最大值的子集数目](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`回溯`](/leetcode/outline/tag/backtracking.md) `1+` | <font color=#ffb800>Medium</font> |
+| 2044 | [统计按位或能得到最大值的子集数目](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/2044) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`回溯`](/leetcode/outline/tag/backtracking.md) `1+` | <font color=#ffb800>Medium</font> |
 
 <style>
 .blue {

assets/output/0085.md

@@ -116,7 +116,7 @@ largest rectangle containing only `1`'s and return _its area_.
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 |
 | :------: | :------ | :------: | :------ | :------ |
-| 84 | [柱状图中最大的矩形](https://leetcode.com/problems/largest-rectangle-in-histogram) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`数组`](/leetcode/outline/tag/array.md) [`单调栈`](/leetcode/outline/tag/monotonic-stack.md) | <font color=#ff334b>Hard</font> |
+| 84 | [柱状图中最大的矩形](https://leetcode.com/problems/largest-rectangle-in-histogram) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0084) |  [`栈`](/leetcode/outline/tag/stack.md) [`数组`](/leetcode/outline/tag/array.md) [`单调栈`](/leetcode/outline/tag/monotonic-stack.md) | <font color=#ff334b>Hard</font> |
 | 221 | [最大正方形](https://leetcode.com/problems/maximal-square) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0221) |  [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) [`矩阵`](/leetcode/outline/tag/matrix.md) | <font color=#ffb800>Medium</font> |
 
 <style>

assets/output/0098.md

@@ -9,65 +9,87 @@ 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, 10^4]`.
-- `-231 <= Node.val <= 231 - 1`
+  * The number of nodes in the tree is in the range `[1, 104]`.
+  * `-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, 10^4]` 内
-- `-231 <= Node.val <= 231 - 1`
+  * 树中节点数目范围在`[1, 104]` 内
+  * `-231 <= Node.val <= 231 - 1`
+
 
 ## 解题思路
 

assets/output/0104.md

@@ -6,52 +6,76 @@
 
 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, 10^4]`.
-- `-100 <= Node.val <= 100`
+  * The number of nodes in the tree is in the range `[0, 104]`.
+  * `-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, 10^4]` 区间内。
-- `-100 <= Node.val <= 100`
+  * 树中节点的数量在 `[0, 104]` 区间内。
+  * `-100 <= Node.val <= 100`
+
 
 ## 解题思路
 

assets/output/0109.md

@@ -8,51 +8,73 @@ 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 * 10^4]`.
-- `-10^5 <= Node.val <= 10^5`
+  * The number of nodes in `head` is in the range `[0, 2 * 104]`.
+  * `-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 * 10^4]` 范围内
-- `-10^5 <= Node.val <= 10^5`
+  * `head` 中的节点数在`[0, 2 * 104]` 范围内
+  * `-10^5 <= Node.val <= 10^5`
+
 
 ## 解题思路
 

assets/output/0111.md

@@ -9,26 +9,29 @@ 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, 10^5]`.
-- `-1000 <= Node.val <= 1000`
+  * The number of nodes in the tree is in the range `[0, 105]`.
+  * `-1000 <= Node.val <= 1000`
+
 
 ## 题目大意
 
@@ -42,20 +45,35 @@ 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, 10^5]` 内
-- `-1000 <= Node.val <= 1000`
+  * 树中节点数的范围在 `[0, 105]` 内
+  * `-1000 <= Node.val <= 1000`
+
 
 ## 解题思路
 

assets/output/0112.md

@@ -145,7 +145,7 @@ A **leaf** is a node with no children.
 | 113 | [路径总和 II](https://leetcode.com/problems/path-sum-ii) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0113) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`回溯`](/leetcode/outline/tag/backtracking.md) `1+` | <font color=#ffb800>Medium</font> |
 | 124 | [二叉树中的最大路径和](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0124) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) `1+` | <font color=#ff334b>Hard</font> |
 | 129 | [求根节点到叶节点数字之和](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0129) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) | <font color=#ffb800>Medium</font> |
-| 437 | [路径总和 III](https://leetcode.com/problems/path-sum-iii) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) | <font color=#ffb800>Medium</font> |
+| 437 | [路径总和 III](https://leetcode.com/problems/path-sum-iii) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0437) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) | <font color=#ffb800>Medium</font> |
 | 666 | [路径总和 IV](https://leetcode.com/problems/path-sum-iv) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`数组`](/leetcode/outline/tag/array.md) `2+` | <font color=#ffb800>Medium</font> |
 
 <style>

assets/output/0113.md

@@ -125,7 +125,7 @@ leaf node. A **leaf** is a node with no children.
 | :------: | :------ | :------: | :------ | :------ |
 | 112 | [路径总和](https://leetcode.com/problems/path-sum) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0112) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#15bd66>Easy</font> |
 | 257 | [二叉树的所有路径](https://leetcode.com/problems/binary-tree-paths) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0257) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`字符串`](/leetcode/outline/tag/string.md) `2+` | <font color=#15bd66>Easy</font> |
-| 437 | [路径总和 III](https://leetcode.com/problems/path-sum-iii) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) | <font color=#ffb800>Medium</font> |
+| 437 | [路径总和 III](https://leetcode.com/problems/path-sum-iii) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0437) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) | <font color=#ffb800>Medium</font> |
 | 666 | [路径总和 IV](https://leetcode.com/problems/path-sum-iv) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`数组`](/leetcode/outline/tag/array.md) `2+` | <font color=#ffb800>Medium</font> |
 | 2096 | [从二叉树一个节点到另一个节点每一步的方向](https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`字符串`](/leetcode/outline/tag/string.md) `1+` | <font color=#ffb800>Medium</font> |