feat: add solutions to lc problem: No.3366

No.3366.Minimum Array Sum

solution/0100-0199/0199.Binary Tree Right Side View/README.md

@@ -21,38 +21,55 @@ tags:
 
 <p>给定一个二叉树的 <strong>根节点</strong> <code>root</code>，想象自己站在它的右侧，按照从顶部到底部的顺序，返回从右侧所能看到的节点值。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
-<p><strong>示例 1:</strong></p>
+<p><strong class="example">示例 1：</strong></p>
 
-<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/images/tree.jpg" style="width: 270px; " /></p>
+<div class="example-block">
+<p><span class="example-io"><b>输入：</b>root = [1,2,3,null,5,null,4]</span></p>
 
-<pre>
-<strong>输入:</strong> [1,2,3,null,5,null,4]
-<strong>输出:</strong> [1,3,4]
-</pre>
+<p><strong>输出：</strong><span class="example-io">[1,3,4]</span></p>
 
-<p><strong>示例 2:</strong></p>
+<p><strong>解释：</strong></p>
 
-<pre>
-<strong>输入:</strong> [1,null,3]
-<strong>输出:</strong> [1,3]
-</pre>
+<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/images/tmpd5jn43fs-1.png" style="width: 400px; height: 207px;" /></p>
+</div>
 
-<p><strong>示例 3:</strong></p>
+<p><strong class="example">示例 2：</strong></p>
 
-<pre>
-<strong>输入:</strong> []
-<strong>输出:</strong> []
-</pre>
+<div class="example-block">
+<p><span class="example-io"><b>输入：</b>root = [1,2,3,4,null,null,null,5]</span></p>
 
-<p> </p>
+<p><span class="example-io"><b>输出：</b>[1,3,4,5]</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/images/tmpkpe40xeh-1.png" style="width: 400px; height: 214px;" /></p>
+</div>
+
+<p><strong class="example">示例 3：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong><span class="example-io">root = [1,null,3]</span></p>
+
+<p><strong>输出：</strong><span class="example-io">[1,3]</span></p>
+</div>
+
+<p><strong class="example">示例 4：</strong></p>
+
+<div class="example-block">
+<p><span class="example-io"><b>输入：</b>root = []</span></p>
+
+<p><strong>输出：</strong><span class="example-io">[]</span></p>
+
+<p>&nbsp;</p>
+</div>
 
 <p><strong>提示:</strong></p>
 
 <ul>
 	<li>二叉树的节点个数的范围是 <code>[0,100]</code></li>
-	<li><meta charset="UTF-8" /><code>-100 <= Node.val <= 100</code> </li>
+	<li><meta charset="UTF-8" /><code>-100&nbsp;&lt;= Node.val &lt;= 100</code>&nbsp;</li>
 </ul>
 
 <!-- description:end -->

solution/0100-0199/0199.Binary Tree Right Side View/README_EN.md

@@ -23,25 +23,44 @@ tags:
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/images/tree.jpg" style="width: 401px; height: 301px;" />
-<pre>
-<strong>Input:</strong> root = [1,2,3,null,5,null,4]
-<strong>Output:</strong> [1,3,4]
-</pre>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">root = [1,2,3,null,5,null,4]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[1,3,4]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/images/tmpd5jn43fs-1.png" style="width: 400px; height: 207px;" /></p>
+</div>
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre>
-<strong>Input:</strong> root = [1,null,3]
-<strong>Output:</strong> [1,3]
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">root = [1,2,3,4,null,null,null,5]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[1,3,4,5]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/images/tmpkpe40xeh-1.png" style="width: 400px; height: 214px;" /></p>
+</div>
 
 <p><strong class="example">Example 3:</strong></p>
 
-<pre>
-<strong>Input:</strong> root = []
-<strong>Output:</strong> []
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">root = [1,null,3]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[1,3]</span></p>
+</div>
+
+<p><strong class="example">Example 4:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">root = []</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[]</span></p>
+</div>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>

solution/2500-2599/2502.Design Memory Allocator/README_EN.md

@@ -42,15 +42,15 @@ tags:
 <ul>
 	<li><code>Allocator(int n)</code> Initializes an <code>Allocator</code> object with a memory array of size <code>n</code>.</li>
 	<li><code>int allocate(int size, int mID)</code> Find the <strong>leftmost</strong> block of <code>size</code> <strong>consecutive</strong> free memory units and allocate it with the id <code>mID</code>. Return the block&#39;s first index. If such a block does not exist, return <code>-1</code>.</li>
-	<li><code>int free(int mID)</code> Free all memory units with the id <code>mID</code>. Return the number of memory units you have freed.</li>
+	<li><code>int freeMemory(int mID)</code> Free all memory units with the id <code>mID</code>. Return the number of memory units you have freed.</li>
 </ul>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input</strong>
-[&quot;Allocator&quot;, &quot;allocate&quot;, &quot;allocate&quot;, &quot;allocate&quot;, &quot;free&quot;, &quot;allocate&quot;, &quot;allocate&quot;, &quot;allocate&quot;, &quot;free&quot;, &quot;allocate&quot;, &quot;free&quot;]
+[&quot;Allocator&quot;, &quot;allocate&quot;, &quot;allocate&quot;, &quot;allocate&quot;, &quot;freeMemory&quot;, &quot;allocate&quot;, &quot;allocate&quot;, &quot;allocate&quot;, &quot;freeMemory&quot;, &quot;allocate&quot;, &quot;freeMemory&quot;]
 [[10], [1, 1], [1, 2], [1, 3], [2], [3, 4], [1, 1], [1, 1], [1], [10, 2], [7]]
 <strong>Output</strong>
 [null, 0, 1, 2, 1, 3, 1, 6, 3, -1, 0]
@@ -60,21 +60,21 @@ Allocator loc = new Allocator(10); // Initialize a memory array of size 10. All
 loc.allocate(1, 1); // The leftmost block&#39;s first index is 0. The memory array becomes [<strong>1</strong>,_,_,_,_,_,_,_,_,_]. We return 0.
 loc.allocate(1, 2); // The leftmost block&#39;s first index is 1. The memory array becomes [1,<strong>2</strong>,_,_,_,_,_,_,_,_]. We return 1.
 loc.allocate(1, 3); // The leftmost block&#39;s first index is 2. The memory array becomes [1,2,<strong>3</strong>,_,_,_,_,_,_,_]. We return 2.
-loc.free(2); // Free all memory units with mID 2. The memory array becomes [1,_, 3,_,_,_,_,_,_,_]. We return 1 since there is only 1 unit with mID 2.
+loc.freeMemory(2); // Free all memory units with mID 2. The memory array becomes [1,_, 3,_,_,_,_,_,_,_]. We return 1 since there is only 1 unit with mID 2.
 loc.allocate(3, 4); // The leftmost block&#39;s first index is 3. The memory array becomes [1,_,3,<strong>4</strong>,<strong>4</strong>,<strong>4</strong>,_,_,_,_]. We return 3.
 loc.allocate(1, 1); // The leftmost block&#39;s first index is 1. The memory array becomes [1,<strong>1</strong>,3,4,4,4,_,_,_,_]. We return 1.
 loc.allocate(1, 1); // The leftmost block&#39;s first index is 6. The memory array becomes [1,1,3,4,4,4,<strong>1</strong>,_,_,_]. We return 6.
-loc.free(1); // Free all memory units with mID 1. The memory array becomes [_,_,3,4,4,4,_,_,_,_]. We return 3 since there are 3 units with mID 1.
+loc.freeMemory(1); // Free all memory units with mID 1. The memory array becomes [_,_,3,4,4,4,_,_,_,_]. We return 3 since there are 3 units with mID 1.
 loc.allocate(10, 2); // We can not find any free block with 10 consecutive free memory units, so we return -1.
-loc.free(7); // Free all memory units with mID 7. The memory array remains the same since there is no memory unit with mID 7. We return 0.
+loc.freeMemory(7); // Free all memory units with mID 7. The memory array remains the same since there is no memory unit with mID 7. We return 0.
 </pre>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>
 
 <ul>
 	<li><code>1 &lt;= n, size, mID &lt;= 1000</code></li>
-	<li>At most <code>1000</code> calls will be made to <code>allocate</code> and <code>free</code>.</li>
+	<li>At most <code>1000</code> calls will be made to <code>allocate</code> and <code>freeMemory</code>.</li>
 </ul>
 
 <!-- description:end -->

solution/3300-3399/3362.Zero Array Transformation III/README.md

@@ -6,7 +6,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3362.Ze
 
 <!-- problem:start -->
 
-# [3362. 零数组转化 III](https://leetcode.cn/problems/zero-array-transformation-iii)
+# [3362. 零数组变换 III](https://leetcode.cn/problems/zero-array-transformation-iii)
 
 [English Version](/solution/3300-3399/3362.Zero%20Array%20Transformation%20III/README_EN.md)
 

solution/3300-3399/3363.Find the Maximum Number of Fruits Collected/README_EN.md

@@ -50,7 +50,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3363.Fi
 	<li>The 3<sup>rd</sup> child (blue) moves on the path <code>(3,0) -&gt; (3,1) -&gt; (3,2) -&gt; (3, 3)</code>.</li>
 </ul>
 
-<p>In total they collect <code>1 + 6 + 11 + 1 + 4 + 8 + 12 + 13 + 14 + 15 = 100</code> fruits.</p>
+<p>In total they collect <code>1 + 6 + 11 + 16 + 4 + 8 + 12 + 13 + 14 + 15 = 100</code> fruits.</p>
 </div>
 
 <p><strong class="example">Example 2:</strong></p>