feat: add solutinos to lc problem: No.1008

No.1008.Construct Binary Search Tree from Preorder Traversal

Author: yanglbme

solution/1000-1099/1000.Minimum Cost to Merge Stones/README.md

@@ -83,4 +83,3 @@
 ```
 
 <!-- tabs:end -->
-<!-- tabs:end -->

solution/1000-1099/1000.Minimum Cost to Merge Stones/README_EN.md

@@ -111,4 +111,3 @@ The total cost was 25, and this is the minimum possible.
 ```
 
 <!-- tabs:end -->
-<!-- tabs:end -->

solution/1000-1099/1001.Grid Illumination/README.md

@@ -84,4 +84,3 @@
 ```
 
 <!-- tabs:end -->
-<!-- tabs:end -->

solution/1000-1099/1001.Grid Illumination/README_EN.md

@@ -76,5 +76,5 @@ The 1<sup>st</sup>&nbsp;query asks if the lamp at grid[1][0] is illuminated or n
 
 ```
 
-<!-- tabs:end -->
-<!-- tabs:end -->
+
+<!-- tabs:end -->

solution/1000-1099/1003.Check If Word Is Valid After Substitutions/README.md

@@ -87,5 +87,4 @@
 
 ```
 
-<!-- tabs:end -->
-<!-- tabs:end -->
+<!-- tabs:end -->

solution/1000-1099/1003.Check If Word Is Valid After Substitutions/README_EN.md

@@ -81,4 +81,3 @@ Thus, "abcabcababcc" is valid.
 ```
 
 <!-- tabs:end -->
-<!-- tabs:end -->

solution/1000-1099/1006.Clumsy Factorial/README.md

@@ -109,4 +109,3 @@ class Solution {
 ```
 
 <!-- tabs:end -->
-<!-- tabs:end -->

solution/1000-1099/1006.Clumsy Factorial/README_EN.md

@@ -108,5 +108,4 @@ class Solution {
 
 ```
 
-<!-- tabs:end -->
-<!-- tabs:end -->
+<!-- tabs:end -->

solution/1000-1099/1007.Minimum Domino Rotations For Equal Row/README.md

@@ -73,4 +73,3 @@
 ```
 
 <!-- tabs:end -->
-<!-- tabs:end -->

solution/1000-1099/1007.Minimum Domino Rotations For Equal Row/README_EN.md

@@ -63,4 +63,3 @@ In this case, it is not possible to rotate the dominoes to make one row of value
 ```
 
 <!-- tabs:end -->
-<!-- tabs:end -->