add 137 190 201 295 502

Author: 2xiao

assets/output/0137.md

@@ -177,6 +177,7 @@ export default sidebar({
             "0134",
             "0135",
             "0136",
+            "0137",
             "0138",
             "0139",
             "0141",
@@ -202,6 +203,7 @@ export default sidebar({
             "0174",
             "0188",
             "0189",
+            "0190",
             "0191",
             "0198",
             "0199"
@@ -212,6 +214,7 @@ export default sidebar({
           collapsible: true,
           children: [
             "0200",
+            "0201",
             "0202",
             "0203",
             "0205",
@@ -252,6 +255,7 @@ export default sidebar({
             "0283",
             "0289",
             "0290",
+            "0295",
             "0297"
           ],
         },
@@ -313,6 +317,7 @@ export default sidebar({
           text: "0500-0599",
           collapsible: true,
           children: [
+            "0502",
             "0503",
             "0506",
             "0509",

assets/output/0190.md

@@ -2,11 +2,11 @@
 
 二分查找（Binary Search）算法，也叫折半查找算法。二分查找针对的是一个有序的数据集合，查找思想有点类似分治思想。每次都通过跟区间的中间元素对比，将待查找的区间缩小为之前的一半，直到找到要查找的元素，或者区间被缩小为 0。
 
-二分查找是一种非常高效的查找算法，时间复杂度是 O(logn)。
+二分查找是一种非常高效的查找算法，时间复杂度是 `O(log n)`。
 
 ## 循环实现
 
-最简单的情况就是**有序数组**中**不存在重复元素**，，我们在其中用二分查找值等于给定值的数据。
+最简单的情况就是**有序数组**中**不存在重复元素**，我们在其中用二分查找值等于给定值的数据。
 
 ```javascript
 // 二分查找的循环实现
@@ -67,7 +67,7 @@ function bsearchInternally(arr, low, high, value) {
 
 ## 应用场景的局限性
 
-二分查找的时间复杂度是 O(logn)，查找数据的效率非常高。不过，并不是什么情况下都可以用二分查找，它的应用场景是有很大局限性的。
+二分查找的时间复杂度是 `O(log n)`，查找数据的效率非常高。不过，并不是什么情况下都可以用二分查找，它的应用场景是有很大局限性的。
 
 ### 依赖顺序表结构（数组）
 

assets/output/0201.md

@@ -11,15 +11,15 @@
 | :------: | :------ | :------: | :------ | :------ |
 | 0504 | [七进制数](https://leetcode.com/problems/base-7/) |  |  [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#15bd66>Easy</font> |
 | 0405 | [数字转换为十六进制数](https://leetcode.com/problems/convert-a-number-to-hexadecimal/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#15bd66>Easy</font> |
-| 0190 | [颠倒二进制位](https://leetcode.com/problems/reverse-bits/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) | <font color=#15bd66>Easy</font> |
+| 0190 | [颠倒二进制位](https://leetcode.com/problems/reverse-bits/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0190) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) | <font color=#15bd66>Easy</font> |
 | 1009 | [十进制整数的反码](https://leetcode.com/problems/complement-of-base-10-integer/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) | <font color=#15bd66>Easy</font> |
 | 0191 | [位1的个数](https://leetcode.com/problems/number-of-1-bits/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0191) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) | <font color=#15bd66>Easy</font> |
 | 0371 | [两整数之和](https://leetcode.com/problems/sum-of-two-integers/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#ffb800>Medium</font> |
 | 0089 | [格雷编码](https://leetcode.com/problems/gray-code/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数学`](/leetcode/outline/tag/mathematics.md) [`回溯`](/leetcode/outline/tag/backtracking.md) | <font color=#ffb800>Medium</font> |
-| 0201 | [数字范围按位与](https://leetcode.com/problems/bitwise-and-of-numbers-range/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) | <font color=#ffb800>Medium</font> |
+| 0201 | [数字范围按位与](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0201) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) | <font color=#ffb800>Medium</font> |
 | 0338 | [比特位计数](https://leetcode.com/problems/counting-bits/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#15bd66>Easy</font> |
 | 0136 | [只出现一次的数字](https://leetcode.com/problems/single-number/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0136) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) | <font color=#15bd66>Easy</font> |
-| 0137 | [只出现一次的数字 II](https://leetcode.com/problems/single-number-ii/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) | <font color=#ffb800>Medium</font> |
+| 0137 | [只出现一次的数字 II](https://leetcode.com/problems/single-number-ii/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0137) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) | <font color=#ffb800>Medium</font> |
 | 0260 | [只出现一次的数字 III](https://leetcode.com/problems/single-number-iii/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) | <font color=#ffb800>Medium</font> |
 | 0268 | [丢失的数字](https://leetcode.com/problems/missing-number/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0268) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `3+` | <font color=#15bd66>Easy</font> |
 | 1349 | [参加考试的最大学生数](https://leetcode.com/problems/maximum-students-taking-exam/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) `2+` | <font color=#ff334b>Hard</font> |

assets/output/0295.md

@@ -734,7 +734,7 @@ console.log(priorityQueue.count()); // output: 3
 | 0973 | [最接近原点的 K 个点](https://leetcode.com/problems/k-closest-points-to-origin/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0973) |  [`几何`](/leetcode/outline/tag/geometry.md) [`数组`](/leetcode/outline/tag/array.md) [`数学`](/leetcode/outline/tag/mathematics.md) `4+` | <font color=#ffb800>Medium</font> |
 | 1296 | [划分数组为连续数字的集合](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/) |  |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#ffb800>Medium</font> |
 | 0239 | [滑动窗口最大值](https://leetcode.com/problems/sliding-window-maximum/) |  |  [`队列`](/leetcode/outline/tag/queue.md) [`数组`](/leetcode/outline/tag/array.md) [`滑动窗口`](/leetcode/outline/tag/sliding-window.md) `2+` | <font color=#ff334b>Hard</font> |
-| 0295 | [数据流的中位数](https://leetcode.com/problems/find-median-from-data-stream/) |  |  [`设计`](/leetcode/outline/tag/design.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`数据流`](/leetcode/outline/tag/data-streams.md) `2+` | <font color=#ff334b>Hard</font> |
+| 0295 | [数据流的中位数](https://leetcode.com/problems/find-median-from-data-stream/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0295) |  [`设计`](/leetcode/outline/tag/design.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`数据流`](/leetcode/outline/tag/data-streams.md) `2+` | <font color=#ff334b>Hard</font> |
 | 0023 | [合并 K 个升序链表](https://leetcode.com/problems/merge-k-sorted-lists/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0023) |  [`链表`](/leetcode/outline/tag/linked-list.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) [`堆（优先队列）`](/leetcode/outline/tag/heap-priority-queue.md) `1+` | <font color=#ff334b>Hard</font> |
 | 0218 | [天际线问题](https://leetcode.com/problems/the-skyline-problem/) |  |  [`树状数组`](/leetcode/outline/tag/fenwick-tree.md) [`线段树`](/leetcode/outline/tag/segment-tree.md) [`数组`](/leetcode/outline/tag/array.md) `4+` | <font color=#ff334b>Hard</font> |