Leetcode: Minimum Domino Rotations For Equal Row
2024-08-26 09:54:25
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 given by A and B: 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: A = [3,5,1,2,3], B = [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. Note: 1 <= A[i], B[i] <= 6
2 <= A.length == B.length <= 20000
1. The final uniform character should be either A[0] or B[0]
2. A[0] could be at the top, or the bottom. Same applies to B[0]
3. If A[0] works, no need to check B[0]; Because if both A[0] and B[0] exist in all dominoes, the result should be the same.
class Solution {
public int minDominoRotations(int[] A, int[] B) {
if (A.length < 1 || B.length < 1 || A.length != B.length) return -1;
int n = A.length;
for (int i = 0, a = 0, b = 0; i < n && (A[0] == A[i] || A[0] == B[i]); i ++) {
if (A[i] != A[0]) a ++; // a stands for try to put A[0] at top
if (B[i] != A[0]) b ++; // b stands for try to put A[0] at bottom
if (i == n - 1) return Math.min(a, b);
} for (int i = 0, a = 0, b = 0; i < n && (B[0] == A[i] || B[0] == B[i]); i ++) {
if (A[i] != B[0]) a ++;
if (B[i] != B[0]) b ++;
if (i == n - 1) return Math.min(a, b);
}
return -1;
}
}
最新文章
- 浅谈系列之 javascript原型与对象
- User Growth Using Deeplink. (part1)
- 1047. Student List for Course (25)
- 计算城市间的球面距离(C++实现)
- Kali Linux Web 渗透测试视频教程— 第四课 google hack 实战
- Linux 中 10 个有用的命令行补全例子
- DM8168 DVRRDK软件框架研究
- hdu 1010 dfs搜索
- APUE-文件和目录(四)文件系统
- 创建以mybatis为基础的web项目(2)mabitis中的一对一关系项目实战
- fiddler安装 与 https
- POJ 1251 Jungle Roads (最小生成树)
- Codeforces Round #544 (Div. 3)解题报告
- Kotlin入门(26)数据库ManagedSQLiteOpenHelper
- Java零基础教程(一)环境搭建
- Vue学习笔记进阶篇——Render函数
- Drupal学习(19) 使用jQuery
- Python实现常见算法[1]——冒泡排序
- RuntimeBroker ClipboardBroker EoP
- python入门6 字符串拼接、格式化输出