Package g3201_3300.s3239_minimum_number_of_flips_to_make_binary_grid_palindromic_i

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3239 - Minimum Number of Flips to Make Binary Grid Palindromic I.

    Medium

    You are given an m x n binary matrix grid.

    A row or column is considered palindromic if its values read the same forward and backward.

    You can flip any number of cells in grid from 0 to 1, or from 1 to 0.

    Return the minimum number of cells that need to be flipped to make either all rows palindromic or all columns palindromic.

    Example 1:

    Input: grid = \[\[1,0,0],0,0,0,0,0,1]

    Output: 2

    Explanation:

    Flipping the highlighted cells makes all the rows palindromic.

    Example 2:

    Input: grid = \[\[0,1],0,1,0,0]

    Output: 1

    Explanation:

    Flipping the highlighted cell makes all the columns palindromic.

    Example 3:

    Input: grid = \[\[1],0]

    Output: 0

    Explanation:

    All rows are already palindromic.

    Constraints:

    • m == grid.length

    • n == grid[i].length

    • <code>1 <= m * n <= 2 * 10<sup>5</sup></code>

    • 0 &lt;= grid[i][j] &lt;= 1

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer minFlips(Array<IntArray> grid)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait