In a row of dominoes, A[i]
and B[i]
represent the top and bottom halves of the i
-th domino. (A domino is a tile with two numbers from 1 to 6 – one on each half of the tile.)
We may rotate the i
-th domino, so that A[i]
and B[i]
swap values.
Return the minimum number of rotations so that all the values in A
are the same, or all the values in B
are the same.
If it cannot be done, return -1
.
Example 1:
Input: A = [2,1,2,4,2,2], B = [5,2,6,2,3,2] Output: 2 Explanation: The first figure represents the dominoes as given by A and B: before we do any rotations. If we rotate the second and fourth dominoes, we can make every value in the top row equal to 2, as indicated by the second figure.
Example 2:
Input: A = [3,5,1,2,3], B = [3,6,3,3,4] Output: -1 Explanation: In this case, it is not possible to rotate the dominoes to make one row of values equal.
Note:
1 <= A[i], B[i] <= 6
2 <= A.length == B.length <= 20000
Solution: Brute Force
Time complexity: O(n)
Space complexity: O(1)
C++
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 |
// Author: Huahua, 72 ms, 14.8 MB class Solution { public: int minDominoRotations(vector<int>& A, vector<int>& B) { int ans = INT_MAX; for (int r = 1; r <= 6; ++r) { bool flag = true; int count_a = 0; int count_b = 0; for (int i = 0; i < A.size(); ++i) { if (A[i] != r && B[i] != r) { flag = false; break; } else if (A[i] == r && B[i] == r) continue; else if (A[i] == r) { ++count_a; } else if (B[i] == r) { ++count_b; } } if (flag) ans = min(ans, min(count_a, count_b)); } return ans == INT_MAX ? -1 : ans; } }; |
请尊重作者的劳动成果,转载请注明出处!花花保留对文章/视频的所有权利。
如果您喜欢这篇文章/视频,欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Be First to Comment