minimum-number-of-flips-to-make-binary-grid-palindromic-i

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an <code>m x n</code> binary matrix <code>grid</code>.

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

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

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

&nbsp;
Example 1:

<div class="example-block">
Input: grid = [[1,0,0],[0,0,0],[0,0,1]]

Output: 2

Explanation:

<img alt="" src="https://assets.leetcode.com/uploads/2024/07/07/screenshot-from-2024-07-08-00-20-10.png" style="width: 420px; height: 108px;" />

Flipping the highlighted cells makes all the rows palindromic.
</div>

Example 2:

<div class="example-block">
Input: grid = [[0,1],[0,1],[0,0]]

Output: 1

Explanation:

<img alt="" src="https://assets.leetcode.com/uploads/2024/07/07/screenshot-from-2024-07-08-00-31-23.png" style="width: 300px; height: 100px;" />

Flipping the highlighted cell makes all the columns palindromic.
</div>

Example 3:

<div class="example-block">
Input: grid = [[1],[0]]

Output: 0

Explanation:

All rows are already palindromic.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>m == grid.length</code></li>
	<li><code>n == grid[i].length</code></li>
	<li><code>1 &lt;= m * n &lt;= 2 * 105</code></li>
	<li><code>0 &lt;= grid[i][j] &lt;= 1</code></li>
</ul>

第 136 场双周赛

biweekly-contest-136

minFlips

高级工程师

Minimum Number of Flips to Make Binary Grid Palindromic I

Minimum Number of Moves to Make Palindrome

minimum-number-of-moves-to-make-palindrome

得到回文串的最少操作次数

Array

Two Pointers

Matrix

给你一个&nbsp;<code>m x n</code>&nbsp;的二进制矩阵&nbsp;<code>grid</code>&nbsp;。

如果矩阵中一行或者一列从前往后与从后往前读是一样的，那么我们称这一行或者这一列是 回文 的。

你可以将 <code>grid</code>&nbsp;中任意格子的值 翻转&nbsp;，也就是将格子里的值从 <code>0</code>&nbsp;变成 <code>1</code>&nbsp;，或者从 <code>1</code>&nbsp;变成 <code>0</code>&nbsp;。

请你返回 最少&nbsp;翻转次数，使得矩阵 要么&nbsp;所有行是 回文的&nbsp;，要么所有列是 回文的&nbsp;。

&nbsp;

示例 1：

<div class="example-block">
输入：grid = [[1,0,0],[0,0,0],[0,0,1]]

输出：2

解释：

<img alt="" src="https://assets.leetcode.com/uploads/2024/07/07/screenshot-from-2024-07-08-00-20-10.png" style="width: 420px; height: 108px;" />

将高亮的格子翻转，得到所有行都是回文的。
</div>

示例 2：

<div class="example-block">
输入：grid = [[0,1],[0,1],[0,0]]

输出：1

解释：

<img alt="" src="https://assets.leetcode.com/uploads/2024/07/07/screenshot-from-2024-07-08-00-31-23.png" style="width: 300px; height: 100px;" />

将高亮的格子翻转，得到所有列都是回文的。
</div>

示例 3：

<div class="example-block">
输入：grid = [[1],[0]]

输出：0

解释：

所有行已经是回文的。
</div>

&nbsp;

提示：

<ul>
	<li><code>m == grid.length</code></li>
	<li><code>n == grid[i].length</code></li>
	<li><code>1 &lt;= m * n &lt;= 2 * 105</code></li>
	<li><code>0 &lt;= grid[i][j] &lt;= 1</code></li>
</ul>