_3239.java

packagecom.fishercoder.solutions.fourththousand;

publicclass_3239 {
publicstaticclassSolution1 {
publicintminFlips(int[][] grid) {
intm = grid.length;
intn = grid[0].length;
intans = m * n;
// try rows first
intflips = 0;
for (inti = 0; i < m; i++) {
for (intleft = 0, right = n - 1; left < right; left++, right--) {
if (grid[i][left] != grid[i][right]) {
flips++;
 }
 }
 }
ans = Math.min(ans, flips);
flips = 0;
// try columns now
for (intj = 0; j < n; j++) {
for (inttop = 0, bottom = m - 1; top < bottom; top++, bottom--) {
if (grid[top][j] != grid[bottom][j]) {
flips++;
 }
 }
 }
ans = Math.min(flips, ans);
returnans;
 }
 }
}