add 1007

Author: luliyucoordinate

README.md

@@ -357,4 +357,5 @@ LeetCode
 |1003|[Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/) | c | [c++](./src/1003-Check-If-Word-Is-Valid-After-Substitutions/1003.cpp) |[python](./src/1003-Check-If-Word-Is-Valid-After-Substitutions/1003.py)|||Medium|
 |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|
+|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|

src/1007-Minimum-Domino-Rotations-For-Equal-Row/1007.cpp

@@ -0,0 +1,26 @@
+static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
+class Solution 
+{
+public:
+    int minDominoRotations(vector<int>& A, vector<int>& B) 
+    {
+        int a = 0, b = 0, n = A.size();
+        for (int i = 0; i < n; ++i)
+        {
+            if (A[i] != A[0] and B[i] != A[0]) break;
+            if (A[i] != A[0]) a++;
+            if (B[i] != A[0]) b++;
+            if (i == n - 1) return min(a, b);
+        }
+        a = 0, b = 0;
+        
+        for (int i = 0; i < n; ++i)
+        {
+            if (A[i] != B[0] and B[i] != B[0]) break;
+            if (A[i] != B[0]) a++;
+            if (B[i] != B[0]) b++;
+            if (i == n - 1) return min(a, b);
+        }
+        return -1;
+    }
+};

src/1007-Minimum-Domino-Rotations-For-Equal-Row/1007.py

@@ -0,0 +1,7 @@
+class Solution:
+    def minDominoRotations(self, A: List[int], B: List[int]) -> int:
+        for i in range(1,7):
+            if all(i == a or i == b for a,b in zip(A,B)):
+                return  min(len(A)-A.count(i),len(B)-B.count(i))
+            
+        return -1