feat: add solutions to lc problem: No.3807 (#4968)

Author: yanglbme

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. 数据结构
 

solution/1200-1299/1266.Minimum Time Visiting All Points/README.md

@@ -45,8 +45,8 @@ tags:
 <pre>
 <strong>输入：</strong>points = [[1,1],[3,4],[-1,0]]
 <strong>输出：</strong>7
-<strong>解释：</strong>一条最佳的访问路径是： <strong>[1,1]</strong> -> [2,2] -> [3,3] -> <strong>[3,4] </strong>-> [2,3] -> [1,2] -> [0,1] -> <strong>[-1,0]</strong>
-从 [1,1] 到 [3,4] 需要 3 秒
+<strong>解释：</strong>一条最佳的访问路径是： <strong>[1,1]</strong> -> [2,2] -> [3,3] -> <strong>[3,4] </strong>-> [2,3] -> [1,2] -> [0,1] -> <strong>[-1,0]</strong>   
+从 [1,1] 到 [3,4] 需要 3 秒 
 从 [3,4] 到 [-1,0] 需要 4 秒
 一共需要 7 秒</pre>
 

solution/1200-1299/1266.Minimum Time Visiting All Points/README_EN.md

@@ -44,8 +44,8 @@ tags:
 <pre>
 <strong>Input:</strong> points = [[1,1],[3,4],[-1,0]]
 <strong>Output:</strong> 7
-<strong>Explanation: </strong>One optimal path is <strong>[1,1]</strong> -&gt; [2,2] -&gt; [3,3] -&gt; <strong>[3,4] </strong>-&gt; [2,3] -&gt; [1,2] -&gt; [0,1] -&gt; <strong>[-1,0]</strong>
-Time from [1,1] to [3,4] = 3 seconds
+<strong>Explanation: </strong>One optimal path is <strong>[1,1]</strong> -&gt; [2,2] -&gt; [3,3] -&gt; <strong>[3,4] </strong>-&gt; [2,3] -&gt; [1,2] -&gt; [0,1] -&gt; <strong>[-1,0]</strong>   
+Time from [1,1] to [3,4] = 3 seconds 
 Time from [3,4] to [-1,0] = 4 seconds
 Total time = 7 seconds</pre>