LeetCode 1007. Minimum Domino Rotations For Equal Row
原题链接在这里: https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/ 题目: 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