【leetcode】1007. 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

>>阅读原文<<