861. Score After Flipping Matrix

We have a two dimensional matrix A where each value is 0 or 1.

A move consists of choosing any row or column, and toggling each value in that row or column: changing all 0s to 1s, and all 1s to 0s.

After making any number of moves, every row of this matrix is interpreted as a binary number, and the score of the matrix is the sum of these numbers.

Return the highest possible score.

Input: [[0,0,1,1],[1,0,1,0],[1,1,0,0]]
Output: 39
Explanation:
Toggled to [[1,1,1,1],[1,0,0,1],[1,1,1,1]].
0b1111 + 0b1001 + 0b1111 = 15 + 9 + 15 = 39

Approach #1: C++.

class Solution {
public:
    int matrixScore(vector<vector<int>>& A) {
        int r = A.size(), c = A[0].size();
        int ans = 0;
        for (int i = 0; i < c; ++i) {
            int col = 0;
            for (int j = 0; j < r; ++j)
                col += A[j][i] ^ A[j][0];       //相同为0， 不同为1。
            ans += max(col, r - col) * (1 << (c - 1 - i));
        }
        return ans;
    }
};

861. Score After Flipping Matrix

原文：https://www.cnblogs.com/ruruozhenhao/p/10305862.html