learning/l33tcode/minimum-domino-rotations-for-equal-row.py at master · fspv/learning · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
from typing import List


class Solution:
    def minDominoRotations(self, A: List[int], B: List[int]) -> int:
        assert len(A) == len(B)

        if not A:
            return 0

        dominos = len(A)

        counter = {A[0]: 0, B[0]: 0}
        counter_first = {A[0]: 0, B[0]: 0}
        counter_both = {A[0]: 0, B[0]: 0}

        for pos in range(dominos):
            for num in counter.keys():
                if num == A[pos] and num == B[pos]:
                    counter[num] += 1
                    counter_both[num] += 1
                    counter_first[num] += 1
                elif num == A[pos]:
                    counter[num] += 1
                    counter_first[num] += 1
                elif num == B[pos]:
                    counter[num] += 1

        result = dominos

        for num, count in counter.items():
            if count == dominos:
                result = min(
                    result,
                    dominos - counter_first[num],
                    counter_first[num] - counter_both[num],
                )

        return result if result < dominos else -1