add 1008

Author: luliyucoordinate

README.md

@@ -358,4 +358,5 @@ LeetCode
 |1004|[Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii/) | c | [c++](./src/1004-Max-Consecutive-Ones-III/1004.cpp) |[python](./src/1004-Max-Consecutive-Ones-III/1004.py)|||Medium|
 |1005|[Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/) | c | [c++](./src/1005-Maximize-Sum-Of-Array-After-K-Negations/1005.cpp) |[python](./src/1005-Maximize-Sum-Of-Array-After-K-Negations/1005.py)|||Easy|
 |1006|[Clumsy Factorial](https://leetcode.com/problems/clumsy-factorial/) | c | [c++](./src/1006-Clumsy-Factorial/1006.cpp) |[python](./src/1006-Clumsy-Factorial/1006.py)|||Medium|
-|1007|[Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/clumsy-factorial/) | c | [c++](./src/1006-Clumsy-Factorial/1006.cpp) |[python](./src/1006-Clumsy-Factorial/1006.py)|||Medium|
+|1007|[Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/) | c | [c++](./src/1007-Minimum-Domino-Rotations-For-Equal-Row/1007.cpp) |[python](./src/1007-Minimum-Domino-Rotations-For-Equal-Row/1007.py)|||Medium|
+|1008|[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/) | c | [c++](./src/1008-Construct-Binary-Search-Tree-from-Preorder-Traversal/1008.cpp) |[python](./src/1008-Construct-Binary-Search-Tree-from-Preorder-Traversal/1008.py)|||Medium|