Package g1001_1100.s1007_minimum_domino_rotations_for_equal_row

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1007 - Minimum Domino Rotations For Equal Row.

    Medium

    In a row of dominoes, tops[i] and bottoms[i] 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.)

    We may rotate the <code>i<sup>th</sup></code> domino, so that tops[i] and bottoms[i] swap values.

    Return the minimum number of rotations so that all the values in tops are the same, or all the values in bottoms are the same.

    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.

    Constraints:

    • <code>2 <= tops.length <= 2 * 10<sup>4</sup></code>

    • bottoms.length == tops.length

    • 1 &lt;= tops[i], bottoms[i] &lt;= 6

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer minDominoRotations(IntArray tops, IntArray bottoms)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait