leetcode 1007. Minimum Domino Rotations For Equal Row

最新推荐文章于 2020-10-01 20:52:03 发布

weixin_41968820

最新推荐文章于 2020-10-01 20:52:03 发布

阅读量246

点赞数

本文链接：https://blog.csdn.net/weixin_41968820/article/details/88379766

版权

class Solution {
public:
    int minDominoRotations(vector<int>& A, vector<int>& B) {
        vector<int> nums;
        int min=0;
        for(int i = 1; i <= 6; i++)
        {
            int changeA=0,changeB=0;
            for(int j = 0; j < A.size(); j++)
            {
                if(A[j] != i && B[j] !=i)
                {break;}
                if(A[j] == i && B[j] !=i)
                    changeB++;
                if(A[j] != i && B[j] ==i)
                    changeA++;
                if(j == A.size()-1)
                {
                    nums.push_back(i);
                    min = changeA<changeB?changeA:changeB;
                }
            }
        }
        if(nums.empty()) return -1;
        return min;
    }
};