Merge pull request #1292 from 0xff-dev/3195

Add solution and test-cases for problem 3195

Author: 6boris

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

@@ -1,28 +1,37 @@
 # [3195.Find the Minimum Area to Cover All Ones 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 a 2D **binary** array `grid`. Find a rectangle with horizontal and vertical sides with the **smallest** area, such that all the 1's in `grid` lie inside this rectangle.
+
+Return the **minimum** possible area of the rectangle.
+
+**Example 1:**  
 
-**Example 1:**
+![1](./1.png)
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: grid = [[0,1,0],[1,0,1]]
+
+Output: 6
+
+Explanation:
+
+The smallest rectangle has a height of 2 and a width of 3, so it has an area of 2 * 3 = 6.
 ```
 
-## 题意
-> ...
+**Example 2:**  
 
-## 题解
+![2](./2.png)
 
-### 思路1
-> ...
-Find the Minimum Area to Cover All Ones I
-```go
 ```
+Input: grid = [[1,0],[0,0]]
+
+Output: 1
 
+Explanation:
+
+The smallest rectangle has both height and width 1, so its area is 1 * 1 = 1.
+```
 
 ## 结语
 

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

@@ -1,5 +1,20 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(grid [][]int) int {
+	leftTop, rightBottom := [2]int{1001, 1001}, [2]int{-1, -1}
+	rows, cols := len(grid), len(grid[0])
+	for i := 0; i < rows; i++ {
+		for j := 0; j < cols; j++ {
+			if grid[i][j] == 1 {
+				leftTop[0] = min(leftTop[0], i)
+				leftTop[1] = min(leftTop[1], j)
+
+				rightBottom[0] = max(rightBottom[0], i)
+				rightBottom[1] = max(rightBottom[1], j)
+			}
+		}
+	}
+	x := rightBottom[0] - leftTop[0]
+	y := rightBottom[1] - leftTop[1]
+	return (x + 1) * (y + 1)
 }

leetcode/3101-3200/3195.Find-the-Minimum-Area-to-Cover-All-Ones-I/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{{0, 1, 0}, {1, 0, 1}}, 6},
+		{"TestCase2", [][]int{{1, 0}, {0, 0}}, 1},
 	}
 
 	//	开始测试
@@ -30,10 +29,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }