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…

public class Solution { public int MatrixScore(int[][] A) { ); ].GetLength(); //判断最高位是否为1 ; i < row; i++) { ] == ))//不是1,则移动此行 { ; j < col; j++) { ) { A[i][j] = ; } else { A[i][j] = ; } } } } //遍历每一列,计算0和1的数量,如果0多,则移动 ; j < col; j++) { ; ; ; i &l…