mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-26 07:18:56 +08:00
37 lines
1.6 KiB
HTML
37 lines
1.6 KiB
HTML
<p>In a row of dominoes, <code>tops[i]</code> and <code>bottoms[i]</code> represent the top and bottom halves of the <code>i<sup>th</sup></code> domino. (A domino is a tile with two numbers from 1 to 6 - one on each half of the tile.)</p>
|
|
|
|
<p>We may rotate the <code>i<sup>th</sup></code> domino, so that <code>tops[i]</code> and <code>bottoms[i]</code> swap values.</p>
|
|
|
|
<p>Return the minimum number of rotations so that all the values in <code>tops</code> are the same, or all the values in <code>bottoms</code> are the same.</p>
|
|
|
|
<p>If it cannot be done, return <code>-1</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/05/14/domino.png" style="height: 300px; width: 421px;" />
|
|
<pre>
|
|
<strong>Input:</strong> tops = [2,1,2,4,2,2], bottoms = [5,2,6,2,3,2]
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong>
|
|
The first figure represents the dominoes as given by tops and bottoms: 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.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> tops = [3,5,1,2,3], bottoms = [3,6,3,3,4]
|
|
<strong>Output:</strong> -1
|
|
<strong>Explanation:</strong>
|
|
In this case, it is not possible to rotate the dominoes to make one row of values equal.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= tops.length <= 2 * 10<sup>4</sup></code></li>
|
|
<li><code>bottoms.length == tops.length</code></li>
|
|
<li><code>1 <= tops[i], bottoms[i] <= 6</code></li>
|
|
</ul>
|