feat: update lc problems (#4906)

Author: yanglbme

CODE_OF_CONDUCT.md

@@ -14,22 +14,22 @@ appearance, race, religion, or sexual identity and orientation.
 Examples of behavior that contributes to creating a positive environment
 include:
 
--   Using welcoming and inclusive language
--   Being respectful of differing viewpoints and experiences
--   Gracefully accepting constructive criticism
--   Focusing on what is best for the community
--   Showing empathy towards other community members
+- Using welcoming and inclusive language
+- Being respectful of differing viewpoints and experiences
+- Gracefully accepting constructive criticism
+- Focusing on what is best for the community
+- Showing empathy towards other community members
 
 Examples of unacceptable behavior by participants include:
 
--   The use of sexualized language or imagery and unwelcome sexual attention or
-    advances
--   Trolling, insulting/derogatory comments, and personal or political attacks
--   Public or private harassment
--   Publishing others' private information, such as a physical or electronic
-    address, without explicit permission
--   Other conduct which could reasonably be considered inappropriate in a
-    professional setting
+- The use of sexualized language or imagery and unwelcome sexual attention or
+  advances
+- Trolling, insulting/derogatory comments, and personal or political attacks
+- Public or private harassment
+- Publishing others' private information, such as a physical or electronic
+  address, without explicit permission
+- Other conduct which could reasonably be considered inappropriate in a
+  professional setting
 
 ## Our Responsibilities
 

README.md

@@ -52,7 +52,7 @@
 - [乘积小于 K 的子数组](/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md) - `双指针`
 - [位 1 的个数](/solution/0100-0199/0191.Number%20of%201%20Bits/README.md) - `位运算`、`lowbit`
 - [合并区间](/solution/0000-0099/0056.Merge%20Intervals/README.md) - `区间合并`
-    <!-- 排序算法、待补充 -->
+      <!-- 排序算法、待补充 -->
 
 ### 2. 数据结构
 

README_EN.md

@@ -2,18 +2,18 @@
 
 ## 排序算法
 
--   [冒泡排序](/basic/sorting/BubbleSort/README.md)
--   [插入排序](/basic/sorting/InsertionSort/README.md)
--   [希尔排序](/basic/sorting/ShellSort/README.md)
--   [选择排序](/basic/sorting/SelectionSort/README.md)
--   [归并排序](/basic/sorting/MergeSort/README.md)
--   [快速排序](/basic/sorting/QuickSort/README.md)
--   [堆排序](/basic/sorting/HeapSort/README.md)
--   [计数排序](/basic/sorting/CountingSort/README.md)
+- [冒泡排序](/basic/sorting/BubbleSort/README.md)
+- [插入排序](/basic/sorting/InsertionSort/README.md)
+- [希尔排序](/basic/sorting/ShellSort/README.md)
+- [选择排序](/basic/sorting/SelectionSort/README.md)
+- [归并排序](/basic/sorting/MergeSort/README.md)
+- [快速排序](/basic/sorting/QuickSort/README.md)
+- [堆排序](/basic/sorting/HeapSort/README.md)
+- [计数排序](/basic/sorting/CountingSort/README.md)
 
 ## 查找算法
 
--   [二分查找](/basic/searching/BinarySearch/README.md)
+- [二分查找](/basic/searching/BinarySearch/README.md)
 
 ## 版权
 

basic/README.md

@@ -2,18 +2,18 @@
 
 ## Sorting
 
--   [Bubble Sort](/basic/sorting/BubbleSort/README.md)
--   [Insertion Sort](/basic/sorting/InsertionSort/README.md)
--   [Shell Sort](/basic/sorting/ShellSort/README.md)
--   [Selection Sort](/basic/sorting/SelectionSort/README.md)
--   [Merge Sort](/basic/sorting/MergeSort/README.md)
--   [Quick Sort](/basic/sorting/QuickSort/README.md)
--   [Heap Sort](/basic/sorting/HeapSort/README.md)
--   [Counting Sort](/basic/sorting/CountingSort/README.md)
+- [Bubble Sort](/basic/sorting/BubbleSort/README.md)
+- [Insertion Sort](/basic/sorting/InsertionSort/README.md)
+- [Shell Sort](/basic/sorting/ShellSort/README.md)
+- [Selection Sort](/basic/sorting/SelectionSort/README.md)
+- [Merge Sort](/basic/sorting/MergeSort/README.md)
+- [Quick Sort](/basic/sorting/QuickSort/README.md)
+- [Heap Sort](/basic/sorting/HeapSort/README.md)
+- [Counting Sort](/basic/sorting/CountingSort/README.md)
 
 ## Searching
 
--   [Binary Search](/basic/searching/BinarySearch/README.md)
+- [Binary Search](/basic/searching/BinarySearch/README.md)
 
 ## Copyright
 

basic/README_EN.md

@@ -55,8 +55,8 @@ int search(int left, int right) {
 
 ## 例题
 
--   [在排序数组中查找元素的第一个和最后一个位置](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md)
--   [x 的平方根](/solution/0000-0099/0069.Sqrt%28x%29/README.md)
--   [寻找峰值](/solution/0100-0199/0162.Find%20Peak%20Element/README.md)
--   [第一个错误的版本](/solution/0200-0299/0278.First%20Bad%20Version/README.md)
--   [不动点](/solution/1000-1099/1064.Fixed%20Point/README.md)
+- [在排序数组中查找元素的第一个和最后一个位置](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md)
+- [x 的平方根](/solution/0000-0099/0069.Sqrt%28x%29/README.md)
+- [寻找峰值](/solution/0100-0199/0162.Find%20Peak%20Element/README.md)
+- [第一个错误的版本](/solution/0200-0299/0278.First%20Bad%20Version/README.md)
+- [不动点](/solution/1000-1099/1064.Fixed%20Point/README.md)

basic/searching/BinarySearch/README.md

@@ -55,8 +55,8 @@ Note that the advantage of these two templates is that they always keep the answ
 
 ## Examples
 
--   [Find First and Last Position of Element in Sorted Array](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README_EN.md)
--   [Sqrt(x)](/solution/0000-0099/0069.Sqrt%28x%29/README_EN.md)
--   [Find Peak Element](/solution/0100-0199/0162.Find%20Peak%20Element/README_EN.md)
--   [First Bad Version](/solution/0200-0299/0278.First%20Bad%20Version/README_EN.md)
--   [Fixed Point](/solution/1000-1099/1064.Fixed%20Point/README_EN.md)
+- [Find First and Last Position of Element in Sorted Array](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README_EN.md)
+- [Sqrt(x)](/solution/0000-0099/0069.Sqrt%28x%29/README_EN.md)
+- [Find Peak Element](/solution/0100-0199/0162.Find%20Peak%20Element/README_EN.md)
+- [First Bad Version](/solution/0200-0299/0278.First%20Bad%20Version/README_EN.md)
+- [Fixed Point](/solution/1000-1099/1064.Fixed%20Point/README_EN.md)

basic/searching/BinarySearch/README_EN.md

@@ -4,13 +4,13 @@
 
 算法描述:
 
--   给定原数组中元素值的范围 `[min, max]`
--   创建一个新数组 `c` ，其长度是 `max-min+1`，其元素默认值都是 `0`
--   遍历原数组中的元素，以原数组中的元素作为 `c` 数组的索引，以原数组中的元素出现次数作为 `c` 数组的元素值。
--   创建结果数组 `r`，起始索引 `i`
--   遍历数组 `c`，找出其中元素大于 `0` 的元素，将其对应的索引作为元素值填充到 `r` 数组中，每处理一次，`c` 中的元素值减 `1`，直到该元素值不大于 `0`，依次处理 `c` 中剩下的元素
+- 给定原数组中元素值的范围 `[min, max]`
+- 创建一个新数组 `c` ，其长度是 `max-min+1`，其元素默认值都是 `0`
+- 遍历原数组中的元素，以原数组中的元素作为 `c` 数组的索引，以原数组中的元素出现次数作为 `c` 数组的元素值。
+- 创建结果数组 `r`，起始索引 `i`
+- 遍历数组 `c`，找出其中元素大于 `0` 的元素，将其对应的索引作为元素值填充到 `r` 数组中，每处理一次，`c` 中的元素值减 `1`，直到该元素值不大于 `0`，依次处理 `c` 中剩下的元素
 
 ## 算法分析
 
--   时间复杂度 $O(n+k)$， 其中 $n$ 为排序数组长度，而 $k$ 为排序数组中数值的取值范围，当 $k\lt n$ 时，时间复杂度为 $O(n)$。
--   空间复杂度 $O(n+k)$， 其中 $n$ 为排序数组长度，而 $k$ 为排序数组中数值的取值范围，当 $k\lt n$ 时，空间复杂度为 $O(n)$。
+- 时间复杂度 $O(n+k)$， 其中 $n$ 为排序数组长度，而 $k$ 为排序数组中数值的取值范围，当 $k\lt n$ 时，时间复杂度为 $O(n)$。
+- 空间复杂度 $O(n+k)$， 其中 $n$ 为排序数组长度，而 $k$ 为排序数组中数值的取值范围，当 $k\lt n$ 时，空间复杂度为 $O(n)$。

basic/sorting/CountingSort/README.md

@@ -51,8 +51,8 @@ for (int i = n / 2; i > 0; --i) {
 
 **数据范围**
 
--   1 ≤ m ≤ n ≤ 10^5
--   1 ≤ 数列中元素 ≤ 10^9
+- 1 ≤ m ≤ n ≤ 10^5
+- 1 ≤ 数列中元素 ≤ 10^9
 
 **输入样例：**
 

basic/sorting/HeapSort/README.md

@@ -10,8 +10,8 @@
 
 与冒泡排序对比：
 
--   在冒泡排序中，经过每一轮的排序处理后，数组后端的数是排好序的。
--   在插入排序中，经过每一轮的排序处理后，数组前端的数是排好序的。
+- 在冒泡排序中，经过每一轮的排序处理后，数组后端的数是排好序的。
+- 在插入排序中，经过每一轮的排序处理后，数组前端的数是排好序的。
 
 ## 代码示例