Leetcode 【832、1007】

class Solution:
    def flipAndInvertImage(self, A: List[List[int]]) -> List[List[int]]:
        row, col = len(A), len(A[0])
        for i in range(row):  # 翻转每行数字
            for j in range(col//2):
                A[i][j], A[i][col-1-j] = A[i][col-1-j], A[i][j]
        for i in range(row):  # 翻转01
            for j in range(col):
                A[i][j] = 1 if A[i][j] == 0 else 0
        return A

class Solution:
    def minDominoRotations(self, A: List[int], B: List[int]) -> int:
        def compare(A, B):
            min_ = float("inf")
            for i in range(1, 7):
                cnt = 0
                flag = True
                for j in range(len(B)):
                    if A[j] != i and B[j] == i:  # 将B中的数与A翻转
                        cnt += 1
                    elif A[j] == i:  # A不用翻转
                        continue
                    else:  # A无法变成全等的数字
                        flag = False
                        break
                if flag:
                    min_ = min(min_, cnt)  # 更新最小值
            return min_
        
        minA = compare(A, B)  # 利用B翻转使A全等
        minB = compare(B, A)  # 利用A翻转使B全等
        min_ = min(minA, minB)
        return min_ if min_ != float("inf") else -1  # 如果都无法翻转返回-1