Class Solution
- java.lang.Object
-
- g0801_0900.s0861_score_after_flipping_matrix.Solution
-
public class Solution extends Object
861 - Score After Flipping Matrix.Medium
You are given an
m x n
binary matrixgrid
.A move consists of choosing any row or column and toggling each value in that row or column (i.e., changing all
0
’s to1
’s, and all1
’s to0
’s).Every row of the matrix is interpreted as a binary number, and the score of the matrix is the sum of these numbers.
Return the highest possible score after making any number of moves (including zero moves).
Example 1:
Input: grid = [[0,0,1,1],[1,0,1,0],[1,1,0,0]]
Output: 39
Explanation: 0b1111 + 0b1001 + 0b1111 = 15 + 9 + 15 = 39
Example 2:
Input: grid = [[0]]
Output: 1
Constraints:
m == grid.length
n == grid[i].length
1 <= m, n <= 20
grid[i][j]
is either0
or1
.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description int
matrixScore(int[][] grid)
-