feat: add solutions to lc problem: No.3787

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/2000-2099/2045.Second Minimum Time to Reach Destination/README_EN.md

@@ -62,7 +62,7 @@ The red path shows the path to get the second minimum time.
 - Wait at 4 for 4 minutes, time elapsed=10
 - 4 -> 5: 3 minutes, time elapsed=13
 Hence the second minimum time is 13 minutes.
-    </pre>
+  </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/images/eg2.png" style="width: 225px; height: 50px;" />