[贪心] leetcode 861 Score After Flipping Matrix

class Solution {
public:
    vector<int> zeros;
    int matrixScore(vector<vector<int>>& A) {
        int m = A.size();
        int n = A[0].size();
        
        int h = m / 2;
        for(int j = 0;j < n;j++)
        {
            int zeros = 0;
            for(int i = 0;i < m;i++)
            {
                if(A[i][j] == 0)
                    zeros++;
            }
            // flip col
            if(zeros > h)
            {
                for(int i = 0;i < m;i++)
                {
                    A[i][j] = !A[i][j];
                }
            }
            
            // flip row
            if(j == 0)
            {
                for(int i = 0;i < m;i++)
                {
                    if(A[i][j] == 0)
                    {
                        for(int k = 0;k < n;k++)
                        {
                            A[i][k] = !A[i][k];
                        }
                    }
                }
            }
        }
        
        int res = 0;
        for(int i = 0;i < m;i++)
        {
            for(int j = 0;j < n;j++)
            {
                if(A[i][j] == 1)
                    res += (1 << (n - j - 1));
            }
        }
        return res;
    }
};