#1007

Minimum Domino Rotations For Equal Row

specialist · 770 · lc medium +31 · verified · 56.5% accepted · 3,285 likes · top 51%

Description

You have a row of dominoes where tops[i] and bottoms[i] represent the top and bottom halves of the i^th domino. Rotating a domino swaps tops[i] and bottoms[i].

Return the minimum number of rotations required to make all values in tops equal or all values in bottoms equal. If it cannot be done, return -1.

Example 1:

Input: tops = [2,1,2,4,2,2], bottoms = [5,2,6,2,3,2]

Output: 2

Explanation:

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.

Example 2:

Input: tops = [3,5,1,2,3], bottoms = [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.

Code

1

2

3

class Solution:
    def minDominoRotations(self, tops: List[int], bottoms: List[int]) -> int:

class Solution:
    def minDominoRotations(self, tops: List[int], bottoms: List[int]) -> int: