Merge pull request #1293 from 0xff-dev/3197

Add solution and test-cases for problem 3197

Author: 6boris

leetcode/3101-3200/3197.Find-the-Minimum-Area-to-Cover-All-Ones-II/1.png

@@ -1,28 +1,43 @@
 # [3197.Find the Minimum Area to Cover All Ones II][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 a 2D **binary** array `grid`. You need to find 3 **non-overlapping** rectangles having **non-zero** areas with horizontal and vertical sides such that all the 1's in `grid` lie inside these rectangles.
+
+Return the **minimum** possible sum of the area of these rectangles.
+
+**Note** that the rectangles are allowed to touch.
 
-**Example 1:**
+**Example 1:** 
+
+![1](./1.png)
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: grid = [[1,0,1],[1,1,1]]
+
+Output: 5
+
+Explanation:
+
+The 1's at (0, 0) and (1, 0) are covered by a rectangle of area 2.
+The 1's at (0, 2) and (1, 2) are covered by a rectangle of area 2.
+The 1 at (1, 1) is covered by a rectangle of area 1.
 ```
 
-## 题意
-> ...
+**Example 2:** 
 
-## 题解
+![2](./2.png)
 
-### 思路1
-> ...
-Find the Minimum Area to Cover All Ones II
-```go
 ```
+Input: grid = [[1,0,1,0],[0,1,0,1]]
+
+Output: 5
 
+Explanation:
+
+The 1's at (0, 0) and (0, 2) are covered by a rectangle of area 3.
+The 1 at (1, 1) is covered by a rectangle of area 1.
+The 1 at (1, 3) is covered by a rectangle of area 1.
+```
 
 ## 结语
 

leetcode/3101-3200/3197.Find-the-Minimum-Area-to-Cover-All-Ones-II/2.png

@@ -1,5 +1,64 @@
 package Solution
 
-func Solution(x bool) bool {
-return x
+import "math"
+
+func minimumSum2(grid [][]int, u, d, l, r int) int {
+min_i, max_i := len(grid), 0
+min_j, max_j := len(grid[0]), 0
+for i := u; i <= d; i++ {
+for j := l; j <= r; j++ {
+if grid[i][j] == 1 {
+min_i = min(min_i, i)
+min_j = min(min_j, j)
+max_i = max(max_i, i)
+max_j = max(max_j, j)
+}
+}
+}
+if min_i <= max_i {
+return (max_i - min_i + 1) * (max_j - min_j + 1)
+}
+return math.MaxInt32 / 3
+}
+
+func rotate(vec [][]int) [][]int {
+n, m := len(vec), len(vec[0])
+ret := make([][]int, m)
+for i := range ret {
+ret[i] = make([]int, n)
+}
+for i := 0; i < n; i++ {
+for j := 0; j < m; j++ {
+ret[m-j-1][i] = vec[i][j]
+}
+}
+return ret
+}
+
+func solve(grid [][]int) int {
+n, m := len(grid), len(grid[0])
+res := n * m
+for i := 0; i+1 < n; i++ {
+for j := 0; j+1 < m; j++ {
+res = min(res, minimumSum2(grid, 0, i, 0, m-1)+
+minimumSum2(grid, i+1, n-1, 0, j)+
+minimumSum2(grid, i+1, n-1, j+1, m-1))
+res = min(res, minimumSum2(grid, 0, i, 0, j)+
+minimumSum2(grid, 0, i, j+1, m-1)+
+minimumSum2(grid, i+1, n-1, 0, m-1))
+}
+}
+for i := 0; i+2 < n; i++ {
+for j := i + 1; j+1 < n; j++ {
+res = min(res, minimumSum2(grid, 0, i, 0, m-1)+
+minimumSum2(grid, i+1, j, 0, m-1)+
+minimumSum2(grid, j+1, n-1, 0, m-1))
+}
+}
+return res
+}
+
+func Solution(grid [][]int) int {
+rgrid := rotate(grid)
+return min(solve(grid), solve(rgrid))
 }

leetcode/3101-3200/3197.Find-the-Minimum-Area-to-Cover-All-Ones-II/README.md

@@ -10,12 +10,11 @@ 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, 1}, {1, 1, 1}}, 5},
+{"TestCase2", [][]int{{1, 0, 1, 0}, {0, 1, 0, 1}}, 5},
 }
 
 //	开始测试
@@ -30,10 +29,10 @@ func TestSolution(t *testing.T) {
 }
 }
 
-//压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//使用案列
+// 使用案列
 func ExampleSolution() {
 }