feat: update lc problems

Author: yanglbme

lcci/03.03.Stack of Plates/README.md

@@ -1,6 +1,9 @@
 # [面试题 03.03. 堆盘子](https://leetcode.cn/problems/stack-of-plates-lcci)
+
 [English Version](/lcci/03.03.Stack%20of%20Plates/README_EN.md)
+
 ## 题目描述
+
 <!-- 这里写题目描述 -->
 <p>堆盘子。设想有一堆盘子，堆太高可能会倒下来。因此，在现实生活中，盘子堆到一定高度时，我们就会另外堆一堆盘子。请实现数据结构<code>SetOfStacks</code>，模拟这种行为。<code>SetOfStacks</code>应该由多个栈组成，并且在前一个栈填满时新建一个栈。此外，<code>SetOfStacks.push()</code>和<code>SetOfStacks.pop()</code>应该与普通栈的操作方法相同（也就是说，pop()返回的值，应该跟只有一个栈时的情况一样）。 进阶：实现一个<code>popAt(int index)</code>方法，根据指定的子栈，执行pop操作。</p>
 <p>当某个栈为空时，应当删除该栈。当栈中没有元素或不存在该栈时，<code>pop</code>，<code>popAt</code>&nbsp;应返回 -1.</p>
@@ -18,20 +21,29 @@
 <strong> 输出</strong>：
 [null, null, null, null, 2, 1, 3]
 </pre>
+
 ## 解法
 <!-- 这里可写通用的实现逻辑 -->
+
 <!-- tabs:start -->
+
 ### **Python3**
+
 <!-- 这里可写当前语言的特殊实现逻辑 -->
+
 ```python
 
 ```
 ### **Java**
+
 <!-- 这里可写当前语言的特殊实现逻辑 -->
+
 ```java
 
 ```
+
 ### **TypeScript**
+
 ```ts
 class StackOfPlates {
     private cap: number;
@@ -84,8 +96,11 @@ class StackOfPlates {
  * var param_3 = obj.popAt(index)
  */
 ```
+
 ### **...**
+
 ```
 
 ```
+
 <!-- tabs:end -->

lcci/03.03.Stack of Plates/README_EN.md

@@ -1,49 +1,60 @@
 # [03.03. Stack of Plates](https://leetcode.cn/problems/stack-of-plates-lcci)
+
 [中文文档](/lcci/03.03.Stack%20of%20Plates/README.md)
+
 ## Description
+
 <p>Imagine a (literal) stack of plates. If the stack gets too high, it might topple. Therefore, in real life, we would likely start a new stack when the previous stack exceeds some threshold. Implement a data structure <code>SetOfStacks</code> that mimics this.&nbsp;<code>SetOfStacks</code> should be composed of several stacks and should create a new stack once the previous one exceeds capacity. <code>SetOfStacks.push()</code> and <code>SetOfStacks.pop()</code> should behave identically to a single stack (that is, <code>pop()</code> should return the same values as it would if there were just a single stack). Follow Up: Implement a function <code>popAt(int index)</code> which performs a pop operation on a specific sub-stack.</p>
 <p>You should delete the sub-stack when it becomes empty. <code>pop</code>, <code>popAt</code> should return -1 when there&#39;s no element to pop.</p>
 <p><strong>Example1:</strong></p>
 <pre>
 
-<strong> Input</strong>: 
+<strong> Input</strong>:
 
 [&quot;StackOfPlates&quot;, &quot;push&quot;, &quot;push&quot;, &quot;popAt&quot;, &quot;pop&quot;, &quot;pop&quot;]
 
 [[1], [1], [2], [1], [], []]
 
-<strong> Output</strong>: 
+<strong> Output</strong>:
 
 [null, null, null, 2, 1, -1]
 
-<strong> Explanation</strong>: 
+<strong> Explanation</strong>:
 
 </pre>
 <p><strong>Example2:</strong></p>
 <pre>
 
-<strong> Input</strong>: 
+<strong> Input</strong>:
 
 [&quot;StackOfPlates&quot;, &quot;push&quot;, &quot;push&quot;, &quot;push&quot;, &quot;popAt&quot;, &quot;popAt&quot;, &quot;popAt&quot;]
 
 [[2], [1], [2], [3], [0], [0], [0]]
 
-<strong> Output</strong>: 
+<strong> Output</strong>:
 
 [null, null, null, null, 2, 1, 3]
 
 </pre>
+
 ## Solutions
+
 <!-- tabs:start -->
+
 ### **Python3**
+
 ```python
 
 ```
+
 ### **Java**
+
 ```java
 
 ```
+
 ### **TypeScript**
+
 ```ts
 class StackOfPlates {
     private cap: number;
@@ -96,8 +107,11 @@ class StackOfPlates {
  * var param_3 = obj.popAt(index)
  */
 ```
+
 ### **...**
+
 ```
 
 ```
+
 <!-- tabs:end -->

lcci/04.09.BST Sequences/README.md

@@ -1,6 +1,9 @@
 # [面试题 04.09. 二叉搜索树序列](https://leetcode.cn/problems/bst-sequences-lcci)
+
 [English Version](/lcci/04.09.BST%20Sequences/README_EN.md)
+
 ## 题目描述
+
 <!-- 这里写题目描述 -->
 <p>从左向右遍历一个数组，通过不断将其中的元素插入树中可以逐步地生成一棵二叉搜索树。给定一个由不同节点组成的二叉树，输出所有可能生成此树的数组。</p>
 <p><strong>示例:</strong><br>
@@ -15,21 +18,33 @@
    [2,3,1]
 ]
 </pre>
+
 ## 解法
+
 <!-- 这里可写通用的实现逻辑 -->
+
 <!-- tabs:start -->
+
 ### **Python3**
+
 <!-- 这里可写当前语言的特殊实现逻辑 -->
+
 ```python
 
 ```
+
 ### **Java**
+
 <!-- 这里可写当前语言的特殊实现逻辑 -->
+
 ```java
 
 ```
+
 ### **...**
+
 ```
 
 ```
+
 <!-- tabs:end -->

lcci/04.09.BST Sequences/README_EN.md

@@ -1,6 +1,9 @@
 # [04.09. BST Sequences](https://leetcode.cn/problems/bst-sequences-lcci)
+
 [中文文档](/lcci/04.09.BST%20Sequences/README.md)
+
 ## Description
+
 <p>A binary search tree was created by traversing through an array from left to right and inserting each element. Given a binary search tree with distinct elements, print all possible arrays that could have led to this tree.</p>
 <p><strong>Example:</strong><br />
 Given the following tree:</p>
@@ -18,25 +21,34 @@ Given the following tree:</p>
 
 [
 
-   [2,1,3],
+[2,1,3],
 
-   [2,3,1]
+[2,3,1]
 
 ]
 
 </pre>
+
 ## Solutions
+
 <!-- tabs:start -->
+
 ### **Python3**
+
 ```python
 
 ```
+
 ### **Java**
+
 ```java
 
 ```
+
 ### **...**
+
 ```
 
 ```
+
 <!-- tabs:end -->

lcci/05.02.Bianry Number to String/README.md

@@ -1,6 +1,9 @@
 # [面试题 05.02. 二进制数转字符串](https://leetcode.cn/problems/bianry-number-to-string-lcci)
+
 [English Version](/lcci/05.02.Bianry%20Number%20to%20String/README_EN.md)
+
 ## 题目描述
+
 <!-- 这里写题目描述 -->
 <p>二进制数转字符串。给定一个介于0和1之间的实数（如0.72），类型为double，打印它的二进制表达式。如果该数字不在0和1之间，<strong>或者</strong>无法精确地用32位以内的二进制表示，则打印&ldquo;ERROR&rdquo;。</p>
 <p><strong>示例1:</strong></p>
@@ -16,21 +19,33 @@
 <ol>
 	<li>32位包括输出中的&quot;0.&quot;这两位。</li>
 </ol>
+
 ## 解法
+
 <!-- 这里可写通用的实现逻辑 -->
+
 <!-- tabs:start -->
+
 ### **Python3**
+
 <!-- 这里可写当前语言的特殊实现逻辑 -->
+
 ```python
 
 ```
+
 ### **Java**
+
 <!-- 这里可写当前语言的特殊实现逻辑 -->
+
 ```java
 
 ```
+
 ### **...**
+
 ```
 
 ```
+
 <!-- tabs:end -->

lcci/05.02.Bianry Number to String/README_EN.md

@@ -1,6 +1,9 @@
 # [05.02. Bianry Number to String](https://leetcode.cn/problems/bianry-number-to-string-lcci)
+
 [中文文档](/lcci/05.02.Bianry%20Number%20to%20String/README.md)
+
 ## Description
+
 <p>Given a real number between O and 1 (e.g., 0.72) that is passed in as a double, print the binary representation. If the number cannot be represented accurately in binary with at most 32 characters, print &quot;ERROR&quot;.</p>
 <p><strong>Example1:</strong></p>
 <pre>
@@ -24,18 +27,27 @@
 <ol>
 	<li>This two charaters &quot;0.&quot; should be counted into 32 characters.</li>
 </ol>
+
 ## Solutions
+
 <!-- tabs:start -->
+
 ### **Python3**
+
 ```python
 
 ```
+
 ### **Java**
+
 ```java
 
 ```
+
 ### **...**
+
 ```
 
 ```
+
 <!-- tabs:end -->

lcci/05.03.Reverse Bits/README.md

@@ -1,6 +1,9 @@
 # [面试题 05.03. 翻转数位](https://leetcode.cn/problems/reverse-bits-lcci)
+
 [English Version](/lcci/05.03.Reverse%20Bits/README_EN.md)
+
 ## 题目描述
+
 <!-- 这里写题目描述 -->
 <p>给定一个32位整数 <code>num</code>，你可以将一个数位从0变为1。请编写一个程序，找出你能够获得的最长的一串1的长度。</p>
 <p><strong>示例 1：</strong></p>
@@ -11,21 +14,33 @@
 <pre><strong>输入:</strong> <code>num</code> = 7(0111<sub>2</sub>)
 <strong>输出:</strong> 4
 </pre>
+
 ## 解法
+
 <!-- 这里可写通用的实现逻辑 -->
+
 <!-- tabs:start -->
+
 ### **Python3**
+
 <!-- 这里可写当前语言的特殊实现逻辑 -->
+
 ```python
 
 ```
+
 ### **Java**
+
 <!-- 这里可写当前语言的特殊实现逻辑 -->
+
 ```java
 
 ```
+
 ### **...**
+
 ```
 
 ```
+
 <!-- tabs:end -->

lcci/05.03.Reverse Bits/README_EN.md

@@ -1,6 +1,9 @@
 # [05.03. Reverse Bits](https://leetcode.cn/problems/reverse-bits-lcci)
+
 [中文文档](/lcci/05.03.Reverse%20Bits/README.md)
+
 ## Description
+
 <p>You have an integer and you can flip exactly one bit from a 0 to a 1. Write code to find the length of the longest sequence of 1s you could create.</p>
 <p><strong>Example 1: </strong></p>
 <pre>
@@ -18,18 +21,27 @@
 <strong>Output:</strong> 4
 
 </pre>
+
 ## Solutions
+
 <!-- tabs:start -->
+
 ### **Python3**
+
 ```python
 
 ```
+
 ### **Java**
+
 ```java
 
 ```
+
 ### **...**
+
 ```
 
 ```
+
 <!-- tabs:end -->