Add solution and test-cases for problem 3239

Author: 0xff-dev

leetcode/3201-3300/3239.Minimum-Number-of-Flips-to-Make-Binary-Grid-Palindromic-I/1.png

@@ -1,28 +1,54 @@
 # [3239.Minimum Number of Flips to Make Binary Grid Palindromic I][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+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:**
+**Example 1:**  
+
+![1](./1.png)
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+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:**  
 
-## 题解
+![2](./2.png)
 
-### 思路1
-> ...
-Minimum Number of Flips to Make Binary Grid Palindromic I
-```go
 ```
+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.
+```
 
 ## 结语
 

leetcode/3201-3300/3239.Minimum-Number-of-Flips-to-Make-Binary-Grid-Palindromic-I/2.png

@@ -1,5 +1,24 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(grid [][]int) int {
+	rows, cols := len(grid), len(grid[0])
+	ans := rows * cols
+	need := 0
+	for i := 0; i < rows; i++ {
+		for s, e := 0, cols-1; s < e; s, e = s+1, e-1 {
+			if grid[i][s] != grid[i][e] {
+				need++
+			}
+		}
+	}
+	ans = min(ans, need)
+	need = 0
+	for i := 0; i < cols; i++ {
+		for s, e := 0, rows-1; s < e; s, e = s+1, e-1 {
+			if grid[s][i] != grid[e][i] {
+				need++
+			}
+		}
+	}
+	return min(ans, need)
 }

leetcode/3201-3300/3239.Minimum-Number-of-Flips-to-Make-Binary-Grid-Palindromic-I/README.md

@@ -10,12 +10,12 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs [][]int
+		expect int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", [][]int{{1, 0, 0}, {0, 0, 0}, {0, 0, 1}}, 2},
+		{"TestCase2", [][]int{{0, 1}, {0, 1}, {0, 0}}, 1},
+		{"TestCase3", [][]int{{1}, {0}}, 0},
 	}
 
 	//	开始测试
@@ -30,10 +30,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }