refactor: update problem template (doocs#2824)

Author: yanglbme

basic/sorting/BubbleSort/README.md

@@ -217,5 +217,3 @@ public class Program
 ```
 
 <!-- tabs:end -->
-
-<!-- end -->

basic/sorting/HeapSort/README.md

@@ -286,7 +286,9 @@ func main() {
 }
 ```
 
-<!-- tabs:end -->## 解法
+<!-- tabs:end -->
+
+## 解法
 
 ### 方法一
 
@@ -500,5 +502,3 @@ fn main() -> io::Result<()> {
 ```
 
 <!-- tabs:end -->
-
-<!-- end -->

basic/sorting/InsertionSort/README.md

@@ -197,5 +197,3 @@ public class Program
 ```
 
 <!-- tabs:end -->
-
-<!-- end -->

basic/sorting/MergeSort/README.md

@@ -362,5 +362,3 @@ process.stdin.on('end', function () {
 ```
 
 <!-- tabs:end -->
-
-<!-- end -->

basic/sorting/QuickSort/README.md

@@ -319,5 +319,3 @@ process.stdin.on('end', function () {
 ```
 
 <!-- tabs:end -->
-
-<!-- end -->

basic/sorting/SelectionSort/README.md

@@ -199,5 +199,3 @@ public class Program
 ```
 
 <!-- tabs:end -->
-
-<!-- end -->

basic/sorting/ShellSort/README.md

@@ -114,5 +114,3 @@ console.log(shellSort(arr));
 ```
 
 <!-- tabs:end -->
-
-<!-- end -->

lcci/01.01.Is Unique/README.md

@@ -4,13 +4,16 @@ difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.01.Is%20Unique/README.md
 ---
 
+<!-- problem:start -->
+
 # [面试题 01.01. 判定字符是否唯一](https://leetcode.cn/problems/is-unique-lcci)
 
 [English Version](/lcci/01.01.Is%20Unique/README_EN.md)
 
 ## 题目描述
 
-<!-- 这里写题目描述 -->
+<!-- description:start -->
+
 <p>实现一个算法，确定一个字符串 <code>s</code> 的所有字符是否全都不同。</p>
 
 <p><strong>示例 1：</strong></p>
@@ -31,8 +34,12 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.01.Is%20Unique/REA
 	<li>如果你不使用额外的数据结构，会很加分。</li>
 </ul>
 
+<!-- description:end -->
+
 ## 解法
 
+<!-- solution:start -->
+
 ### 方法一：位运算
 
 根据示例，可以假定字符串中只包含小写字母（实际验证，也符合假设）。
@@ -152,4 +159,6 @@ class Solution {
 
 <!-- tabs:end -->
 
-<!-- end -->
+<!-- solution:end -->
+
+<!-- problem:end -->

lcci/01.01.Is Unique/README_EN.md

@@ -4,12 +4,16 @@ difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.01.Is%20Unique/README_EN.md
 ---
 
+<!-- problem:start -->
+
 # [01.01. Is Unique](https://leetcode.cn/problems/is-unique-lcci)
 
 [中文文档](/lcci/01.01.Is%20Unique/README.md)
 
 ## Description
 
+<!-- description:start -->
+
 <p>Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures?</p>
 
 <p><strong>Example 1:</strong></p>
@@ -38,8 +42,12 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.01.Is%20Unique/REA
 	<li><code>0 &lt;= len(s) &lt;= 100 </code></li>
 </ul>
 
+<!-- description:end -->
+
 ## Solutions
 
+<!-- solution:start -->
+
 ### Solution 1: Bit Manipulation
 
 Based on the examples, we can assume that the string only contains lowercase letters (which is confirmed by actual verification).
@@ -159,4 +167,6 @@ class Solution {
 
 <!-- tabs:end -->
 
-<!-- end -->
+<!-- solution:end -->
+
+<!-- problem:end -->

lcci/01.02.Check Permutation/README.md

@@ -4,13 +4,16 @@ difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.02.Check%20Permutation/README.md
 ---
 
+<!-- problem:start -->
+
 # [面试题 01.02. 判定是否互为字符重排](https://leetcode.cn/problems/check-permutation-lcci)
 
 [English Version](/lcci/01.02.Check%20Permutation/README_EN.md)
 
 ## 题目描述
 
-<!-- 这里写题目描述 -->
+<!-- description:start -->
+
 <p>给定两个字符串 <code>s1</code> 和 <code>s2</code>，请编写一个程序，确定其中一个字符串的字符重新排列后，能否变成另一个字符串。</p>
 
 <p><strong>示例 1：</strong></p>
@@ -32,8 +35,12 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.02.Check%20Permuta
 	<li><code>0 &lt;= len(s2) &lt;= 100 </code></li>
 </ul>
 
+<!-- description:end -->
+
 ## 解法
 
+<!-- solution:start -->
+
 ### 方法一：数组或哈希表
 
 我们先判断两个字符串的长度是否相等，若不相等则直接返回 `false`。
@@ -205,6 +212,10 @@ class Solution {
 
 <!-- tabs:end -->
 
+<!-- solution:end -->
+
+<!-- solution:start-->
+
 ### 方法二：排序
 
 我们也按照字典序对两个字符串进行排序，然后比较两个字符串是否相等。
@@ -271,4 +282,6 @@ impl Solution {
 
 <!-- tabs:end -->
 
-<!-- end -->
+<!-- solution:end -->
+
+<!-- problem:end -->

lcci/01.02.Check Permutation/README_EN.md

@@ -4,12 +4,16 @@ difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.02.Check%20Permutation/README_EN.md
 ---
 
+<!-- problem:start -->
+
 # [01.02. Check Permutation](https://leetcode.cn/problems/check-permutation-lcci)
 
 [中文文档](/lcci/01.02.Check%20Permutation/README.md)
 
 ## Description
 
+<!-- description:start -->
+
 <p>Given two strings,write a method to decide if one is a permutation of the other.</p>
 
 <p><strong>Example 1:</strong></p>
@@ -38,8 +42,12 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.02.Check%20Permuta
 	<li><code>0 &lt;= len(s2) &lt;= 100</code></li>
 </ol>
 
+<!-- description:end -->
+
 ## Solutions
 
+<!-- solution:start -->
+
 ### Solution 1: Array or Hash Table
 
 First, we check whether the lengths of the two strings are equal. If they are not equal, we directly return `false`.
@@ -211,6 +219,10 @@ class Solution {
 
 <!-- tabs:end -->
 
+<!-- solution:end -->
+
+<!-- solution:start -->
+
 ### Solution 2: Sorting
 
 We can also sort the two strings in lexicographical order, and then compare whether the two strings are equal.
@@ -277,4 +289,6 @@ impl Solution {
 
 <!-- tabs:end -->
 
-<!-- end -->
+<!-- solution:end -->
+
+<!-- problem:end -->

lcci/01.03.String to URL/README.md

@@ -4,13 +4,16 @@ difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.03.String%20to%20URL/README.md
 ---
 
+<!-- problem:start -->
+
 # [面试题 01.03. URL 化](https://leetcode.cn/problems/string-to-url-lcci)
 
 [English Version](/lcci/01.03.String%20to%20URL/README_EN.md)
 
 ## 题目描述
 
-<!-- 这里写题目描述 -->
+<!-- description:start -->
+
 <p>URL化。编写一种方法，将字符串中的空格全部替换为<code>%20</code>。假定该字符串尾部有足够的空间存放新增字符，并且知道字符串的&ldquo;真实&rdquo;长度。（注：用<code>Java</code>实现的话，请使用字符数组实现，以便直接在数组上操作。）</p>
 
 <p><strong>示例1:</strong></p>
@@ -31,8 +34,12 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.03.String%20to%20U
 	<li>字符串长度在[0, 500000]范围内。</li>
 </ol>
 
+<!-- description:end -->
+
 ## 解法
 
+<!-- solution:start -->
+
 ### 方法一：使用 `replace()` 函数
 
 直接利用 `replace` 将所有 ` ` 替换为 `%20`：
@@ -93,6 +100,10 @@ class Solution {
 
 <!-- tabs:end -->
 
+<!-- solution:end -->
+
+<!-- solution:start-->
+
 ### 方法二：模拟
 
 遍历字符串每个字符 $c$，遇到空格则将 `%20` 添加到结果中，否则添加 $c$。
@@ -161,4 +172,6 @@ impl Solution {
 
 <!-- tabs:end -->
 
-<!-- end -->
+<!-- solution:end -->
+
+<!-- problem:end -->

lcci/01.03.String to URL/README_EN.md

@@ -4,12 +4,16 @@ difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.03.String%20to%20URL/README_EN.md
 ---
 
+<!-- problem:start -->
+
 # [01.03. String to URL](https://leetcode.cn/problems/string-to-url-lcci)
 
 [中文文档](/lcci/01.03.String%20to%20URL/README.md)
 
 ## Description
 
+<!-- description:start -->
+
 <p>Write a method to replace all spaces in a string with &#39;%20&#39;. You may assume that the string has sufficient space at the end to hold the additional characters,and that you are given the &quot;true&quot; length of the string. (Note: If implementing in Java,please use a character array so that you can perform this operation in place.)</p>
 
 <p><strong>Example 1:</strong></p>
@@ -44,8 +48,12 @@ The missing numbers are [5,6,8,...], hence the third missing number is 8.
 	<li><code>0 &lt;= S.length &lt;= 500000</code></li>
 </ol>
 
+<!-- description:end -->
+
 ## Solutions
 
+<!-- solution:start -->
+
 ### Solution 1: Using `replace()` function
 
 Directly use `replace` to replace all ` ` with `%20`:
@@ -106,6 +114,10 @@ class Solution {
 
 <!-- tabs:end -->
 
+<!-- solution:end -->
+
+<!-- solution:start -->
+
 ### Solution 2: Simulation
 
 Traverse each character $c$ in the string. When encountering a space, add `%20` to the result, otherwise add $c$.
@@ -174,4 +186,6 @@ impl Solution {
 
 <!-- tabs:end -->
 
-<!-- end -->
+<!-- solution:end -->
+
+<!-- problem:end -->

lcci/01.04.Palindrome Permutation/README.md

@@ -4,13 +4,16 @@ difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.04.Palindrome%20Permutation/README.md
 ---
 
+<!-- problem:start -->
+
 # [面试题 01.04. 回文排列](https://leetcode.cn/problems/palindrome-permutation-lcci)
 
 [English Version](/lcci/01.04.Palindrome%20Permutation/README_EN.md)
 
 ## 题目描述
 
-<!-- 这里写题目描述 -->
+<!-- description:start -->
+
 <p>给定一个字符串，编写一个函数判定其是否为某个回文串的排列之一。</p>
 
 <p>回文串是指正反两个方向都一样的单词或短语。排列是指字母的重新排列。</p>
@@ -27,8 +30,12 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcci/01.04.Palindrome%20Pe
 
 <p>&nbsp;</p>
 
+<!-- description:end -->
+
 ## 解法
 
+<!-- solution:start -->
+
 ### 方法一：哈希表
 
 我们用哈希表 $cnt$ 存储每个字符出现的次数。若次数为奇数的字符超过 $1$ 个，则不是回文排列。
@@ -146,6 +153,10 @@ class Solution {
 
 <!-- tabs:end -->
 
+<!-- solution:end -->
+
+<!-- solution:start-->
+
 ### 方法二：哈希表的另一种实现
 
 我们用哈希表 $vis$ 存储每个字符是否出现过。若出现过，则从哈希表中删除该字符；否则，将该字符加入哈希表。
@@ -202,4 +213,6 @@ public:
 
 <!-- tabs:end -->
 
-<!-- end -->
+<!-- solution:end -->
+
+<!-- problem:end -->