fix: fix docs

Author: longsizhuo

app/docs/CommunityShare/Leetcode/142.环形链表II_translated.md

@@ -83,7 +83,7 @@ docId: ylpucy1rbbnfpe3t62u8kcfq
    b.fast Compare slowGo more n Length of a ring，Right now f=s+nb；（ Analyze： Double pointers have gone through a step，然后在环Inside绕圈直到重合，重合hour fast Compare slow Go 环的长度整数Double ）；
    .The above two types are reduced：f=2nb，s=nb，Right nowfastandslow The pointer left separately 2n，n indivual Circumference of the ring （Notice： n yes未知数，不同Linked的情况不同）。
 
-<!--more-->
+&lt;!--more--&gt;
 
 2. Current situation analysis：
 

app/docs/CommunityShare/Leetcode/3072. 将元素分配到两个数组中 II_translated.md

@@ -36,7 +36,7 @@ docId: r12u8o7j73oxhbvgphi939fb
 
 <p>&nbsp;</p>
 
-<p><strong class="example">Exemplary example 1：</strong></p>
+<p>&lt;strong class="example"&gt;Exemplary example 1：</strong></p>
 
 <pre>
 <strong>enter：</strong>nums = [2,1,3,3]
@@ -48,7 +48,7 @@ exist 4 Secondary operation后，arr1 = [2,3] ，arr2 = [1,3] 。
 therefore，连接形成的Array result yes [2,3,1,3] 。
 </pre>
 
-<p><strong class="example">Exemplary example 2：</strong></p>
+<p>&lt;strong class="example"&gt;Exemplary example 2：</strong></p>
 
 <pre>
 <strong>enter：</strong>nums = [5,14,3,1,2]
@@ -61,7 +61,7 @@ exist 5 Secondary operation后，arr1 = [5,3,1,2] ，arr2 = [14] 。
 therefore，连接形成的Array result yes [5,3,1,2,14] 。
 </pre>
 
-<p><strong class="example">Exemplary example 3：</strong></p>
+<p>&lt;strong class="example"&gt;Exemplary example 3：</strong></p>
 
 <pre>
 <strong>enter：</strong>nums = [3,3,3,3]

app/docs/CommunityShare/Leetcode/538.把二叉搜索树转换为累加树_translated.md

@@ -23,13 +23,13 @@ docId: wen0bbo8m93oih1mx6sva9sh
  <li>左右子Tree也必须是二叉searchTree。</li> 
 </ul>
 
-<p><strong>Notice：</strong>This question 1038:&nbsp;<a href="https://leetcode-cn.com/problems/binary-search-tree-to-greater-sum-tree/">https://leetcode-cn.com/problems/binary-search-tree-to-greater-sum-tree/</a> same</p>
+<p><strong>Notice：</strong>This question 1038:&nbsp;&lt;a href="https://leetcode-cn.com/problems/binary-search-tree-to-greater-sum-tree/"&gt;https://leetcode-cn.com/problems/binary-search-tree-to-greater-sum-tree/</a> same</p>
 
 <p>&nbsp;</p>
 
 <p><strong>Exemplary example 1：</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/05/03/tree.png" style="height: 364px; width: 534px;" /></strong></p>
+<p><strong>&lt;img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/05/03/tree.png" style="height: 364px; width: 534px;" /&gt;</strong></p>
 
 <pre><strong>enter：</strong>[4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
 <strong>Output：</strong>[30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]

app/docs/CommunityShare/Leetcode/6323. 将钱分给最多的儿童_translated.md

@@ -33,9 +33,9 @@ Then you must be divided into one that has been divided 8 Dollar的people，ans
 他再给另一个people 1 Dollar，so ans constant。
 
 The following isylbExplanation of big guys：（2023-9-22renew）
-if money<children，Then there must be children who do not share money，return −1。
+if money&lt;children，Then there must be children who do not share money，return −1。
 
-if money>8×children，So children−1 A child obtained 8 Dollar，剩下的一A child obtained money−8×(children−1) Dollar，return children−1。
+if money&gt;8×children，So children−1 A child obtained 8 Dollar，剩下的一A child obtained money−8×(children−1) Dollar，return children−1。
 
 if money=8×children−4，So children−2 A child obtained 8 Dollar，The remaining two children sharing the rest 12 Dollar（As long as not 4, 8 Dollar就行），return children−2。
 

app/docs/CommunityShare/Leetcode/994.腐烂的橘子_translated.md

@@ -14,7 +14,7 @@ docId: axhoyzdtxoc82q58j1os57c8
 """
 
 <p>Given&nbsp;<code>m x n</code>&nbsp;grid
- <meta charset="UTF-8" />&nbsp;<code>grid</code>&nbsp;middle，Each cell can have one of the following three values：</p>
+ &lt;meta charset="UTF-8" /&gt;&nbsp;<code>grid</code>&nbsp;middle，Each cell can have one of the following three values：</p>
 
 <ul> 
  <li>value&nbsp;<code>0</code>&nbsp;Represents the empty unit；</li> 
@@ -30,7 +30,7 @@ docId: axhoyzdtxoc82q58j1os57c8
 
 <p><strong>Exemplary example 1：</strong></p>
 
-<p><strong><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/02/16/oranges.png" style="height: 137px; width: 650px;" /></strong></p>
+<p><strong>&lt;img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/02/16/oranges.png" style="height: 137px; width: 650px;" /&gt;</strong></p>
 
 <pre>
 <strong>enter：</strong>grid = [[2,1,1],[1,1,0],[0,1,1]]