update: 添加问题“3195.包含所有1的最小矩形面积I”的代码和题解 (#1093)

LetMeFly666 · Copilot · web-flow · commit 6696a97aa23c · 2025-08-22T21:46:18.000+08:00
* archive: many days(words+837题解小改) Signed-off-by: LetMeFly666 <814114971@qq.com> * 3195: WA.cpp (#1092) + docs(jp) + init * 3195: AC.cpp+WA.py (#1092) - 和CPP的WA原因一模一样 cpp - AC,64.89%,94.68% * 3195: AC.py+rs + LEETCODE - bug(#1092) - go写好快 py - AC,25.00%,81.25% rust - AC,40.00%,40.00% Compile timed out. Please try again. If the issue persists, please report it to us. * 3195: AC.go+CE.java (#1092) go - AC,68.42%,42.10% * 3195: AC.java (#1092) - java也写好快 java - AC,98.08%,84.62% * update: 添加问题“3195.包含所有1的最小矩形面积I”的代码和题解 (#1093) Signed-off-by: LetMeFly666 <814114971@qq.com> * fix(words): (9个月前)拼写错误的日语单词 Update Solutions/Other-Japanese-LearningNotes.md Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com> * typo: grid Update Solutions/LeetCode 3195.包含所有1的最小矩形面积I.md Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com> * typo: 即为 Update Solutions/LeetCode 3195.包含所有1的最小矩形面积I.md Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com> --------- Signed-off-by: LetMeFly666 <814114971@qq.com> Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>
diff --git a/.commitmsg b/.commitmsg
diff --git a/Codes/0837-new-21-game.rs b/Codes/0837-new-21-game.rs
@@ -2,15 +2,15 @@
  * @Author: LetMeFly
  * @Date: 2025-08-17 19:33:11
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2025-08-17 22:31:00
+ * @LastEditTime: 2025-08-17 22:55:04
  */
 impl Solution {
     pub fn new21_game(n: i32, k: i32, max_pts: i32) -> f64 {
         let k: usize = k as usize;
         let max_pts: usize = max_pts as usize;
         let n: usize = n as usize;
 
-        let mut dp: Vec<f64> = vec![0 as f64; k + max_pts];
+        let mut dp: Vec<f64> = vec![0.; k + max_pts];
         let mut s: f64 = 0.;
         for i in k..(k+max_pts) {
             if i <= n {
diff --git a/Codes/3195-find-the-minimum-area-to-cover-all-ones-i.cpp b/Codes/3195-find-the-minimum-area-to-cover-all-ones-i.cpp
@@ -0,0 +1,27 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-22 21:18:33
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-22 21:21:31
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int minimumArea(vector<vector<int>>& grid) {
+        int l = 1000, r = 0, u = 1000, d = 0;
+        for (int i = 0; i < grid.size(); i++) {
+            for (int j = 0; j < grid[i].size(); j++) {
+                if (grid[i][j]) {
+                    l = min(l, j);
+                    r = max(r, j);
+                    u = min(u, i);
+                    d = max(d, i);
+                }
+            }
+        }
+        return (r - l + 1) * (d - u + 1);
+    }
+};
diff --git a/Codes/3195-find-the-minimum-area-to-cover-all-ones-i.go b/Codes/3195-find-the-minimum-area-to-cover-all-ones-i.go
@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-22 21:18:33
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-22 21:30:00
+ */
+package main
+
+func minimumArea(grid [][]int) int {
+    l, r, u, d := 1000, 0, 1000, 0
+    for i, row := range grid {
+        for j, g := range row {
+            if g == 1 {
+                l = min(l, j)
+                r = max(r, j)
+                u = min(u, i)
+                d = max(d, i)
+            }
+        }
+    }
+    return (r - l + 1) * (d - u + 1)
+}
diff --git a/Codes/3195-find-the-minimum-area-to-cover-all-ones-i.java b/Codes/3195-find-the-minimum-area-to-cover-all-ones-i.java
@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-22 21:18:33
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-22 21:33:05
+ */
+class Solution {
+    public int minimumArea(int[][] grid) {
+        int l = 1000, r = 0, u = 1000, d = 0;
+        for (int i = 0; i < grid.length; i++) {
+            for (int j = 0; j < grid[i].length; j++) {
+                if (grid[i][j] == 1) {
+                    l = Math.min(l, j);
+                    r = Math.max(r, j);
+                    u = Math.min(u, i);
+                    d = Math.max(d, i);
+                }
+            }
+        }
+        return (r - l + 1) * (d - u + 1);
+    }
+}
diff --git a/Codes/3195-find-the-minimum-area-to-cover-all-ones-i.py b/Codes/3195-find-the-minimum-area-to-cover-all-ones-i.py
@@ -0,0 +1,20 @@
+'''
+Author: LetMeFly
+Date: 2025-08-22 21:18:33
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-08-22 21:23:44
+'''
+from typing import List
+
+class Solution:
+    def minimumArea(self, grid: List[List[int]]) -> int:
+        l = u = 1000
+        r = d = 0
+        for i, line in enumerate(grid):
+            for j, g in enumerate(line):
+                if g:
+                    l = min(l, j)
+                    r = max(r, j)
+                    u = min(u, i)
+                    d = max(d, i)
+        return (r - l + 1) * (d - u + 1)
diff --git a/Codes/3195-find-the-minimum-area-to-cover-all-ones-i.rs b/Codes/3195-find-the-minimum-area-to-cover-all-ones-i.rs
@@ -0,0 +1,25 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-22 21:18:33
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-22 21:28:08
+ */
+impl Solution {
+    pub fn minimum_area(grid: Vec<Vec<i32>>) -> i32 {
+        let mut l: usize = 1000;
+        let mut r: usize = 0;
+        let mut u: usize = 1000;
+        let mut d: usize = 0;
+        for (i, row) in grid.into_iter().enumerate() {
+            for (j, g) in row.into_iter().enumerate() {
+                if g == 1 {
+                    l = l.min(j);
+                    r = r.max(j);
+                    u = u.min(i);
+                    d = d.max(i);
+                }
+            }
+        }
+        ((r - l + 1) * (d - u + 1)) as i32
+    }
+}
diff --git a/Codes/lib.rs b/Codes/lib.rs
@@ -5,4 +5,4 @@
  * @LastEditTime: 2025-08-11 22:07:08
  */
 pub struct Solution;
-include!("0837-new-21-game.rs");  // 这个fileName是会被脚本替换掉的
+include!("3195-find-the-minimum-area-to-cover-all-ones-i.rs");  // 这个fileName是会被脚本替换掉的
diff --git a/README.md b/README.md
@@ -965,6 +965,7 @@
 |3191.使二进制数组全部等于1的最少操作次数I|中等|<a href="https://leetcode.cn/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/18/LeetCode%203191.%E4%BD%BF%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E7%BB%84%E5%85%A8%E9%83%A8%E7%AD%89%E4%BA%8E1%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/143064645" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/solutions/2956198/letmefly-3191shi-er-jin-zhi-shu-zu-quan-n822o/" target="_blank">LeetCode题解</a>|
 |3192.使二进制数组全部等于1的最少操作次数II|中等|<a href="https://leetcode.cn/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/19/LeetCode%203192.%E4%BD%BF%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%95%B0%E7%BB%84%E5%85%A8%E9%83%A8%E7%AD%89%E4%BA%8E1%E7%9A%84%E6%9C%80%E5%B0%91%E6%93%8D%E4%BD%9C%E6%AC%A1%E6%95%B0II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/143066863" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/solutions/2956341/letmefly-3192shi-er-jin-zhi-shu-zu-quan-ih15d/" target="_blank">LeetCode题解</a>|
 |3194.最小元素和最大元素的最小平均值|简单|<a href="https://leetcode.cn/problems/minimum-average-of-smallest-and-largest-elements/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/16/LeetCode%203194.%E6%9C%80%E5%B0%8F%E5%85%83%E7%B4%A0%E5%92%8C%E6%9C%80%E5%A4%A7%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E5%B0%8F%E5%B9%B3%E5%9D%87%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/142994095" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-average-of-smallest-and-largest-elements/solutions/2953616/letmefly-3194zui-xiao-yuan-su-he-zui-da-6f4v5/" target="_blank">LeetCode题解</a>|
+|3195.包含所有1的最小矩形面积I|中等|<a href="https://leetcode.cn/problems/find-the-minimum-area-to-cover-all-ones-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/08/22/LeetCode%203195.%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%891%E7%9A%84%E6%9C%80%E5%B0%8F%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AFI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/150618919" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-minimum-area-to-cover-all-ones-i/solutions/3760997/letmefly-3195bao-han-suo-you-1-de-zui-xi-6h6a/" target="_blank">LeetCode题解</a>|
 |3200.三角形的最大高度|简单|<a href="https://leetcode.cn/problems/maximum-height-of-a-triangle/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/15/LeetCode%203200.%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E9%AB%98%E5%BA%A6/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/142967272" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-height-of-a-triangle/solutions/2952209/letmefly-3200san-jiao-xing-de-zui-da-gao-m23t/" target="_blank">LeetCode题解</a>|
 |3201.找出有效子序列的最大长度I|中等|<a href="https://leetcode.cn/problems/find-the-maximum-length-of-valid-subsequence-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/07/16/LeetCode%203201.%E6%89%BE%E5%87%BA%E6%9C%89%E6%95%88%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E6%9C%80%E5%A4%A7%E9%95%BF%E5%BA%A6I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/149409629" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-maximum-length-of-valid-subsequence-i/solutions/3725834/letmefly-3201zhao-chu-you-xiao-zi-xu-lie-3quj/" target="_blank">LeetCode题解</a>|
 |3202.找出有效子序列的最大长度II|中等|<a href="https://leetcode.cn/problems/find-the-maximum-length-of-valid-subsequence-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/07/18/LeetCode%203202.%E6%89%BE%E5%87%BA%E6%9C%89%E6%95%88%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E6%9C%80%E5%A4%A7%E9%95%BF%E5%BA%A6II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/149491839" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-maximum-length-of-valid-subsequence-ii/solutions/3729058/letmefly-3202zhao-chu-you-xiao-zi-xu-lie-9eyq/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 0837.新21点.md b/Solutions/LeetCode 0837.新21点.md
@@ -208,7 +208,7 @@ impl Solution {
         let max_pts: usize = max_pts as usize;
         let n: usize = n as usize;
 
-        let mut dp: Vec<f64> = vec![0 as f64; k + max_pts];
+        let mut dp: Vec<f64> = vec![0.; k + max_pts];
         let mut s: f64 = 0.;
         for i in k..(k+max_pts) {
             if i <= n {
diff --git a/Solutions/LeetCode 3195.包含所有1的最小矩形面积I.md b/Solutions/LeetCode 3195.包含所有1的最小矩形面积I.md
@@ -0,0 +1,208 @@
+---
+title: 3195.包含所有 1 的最小矩形面积 I：简单题-求长方形四个范围
+date: 2025-08-22 21:34:06
+tags: [题解, LeetCode, 中等, 数组, 矩阵, 模拟, 遍历]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】3195.包含所有 1 的最小矩形面积 I：简单题-求长方形四个范围
+
+力扣题目链接：[https://leetcode.cn/problems/find-the-minimum-area-to-cover-all-ones-i/](https://leetcode.cn/problems/find-the-minimum-area-to-cover-all-ones-i/)
+
+<p>给你一个二维 <strong>二进制 </strong>数组 <code>grid</code>。请你找出一个边在水平方向和竖直方向上、面积 <strong>最小</strong> 的矩形，并且满足 <code>grid</code> 中所有的 1 都在矩形的内部。</p>
+
+<p>返回这个矩形可能的 <strong>最小 </strong>面积。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">grid = [[0,1,0],[1,0,1]]</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">6</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p><img alt="" src="https://assets.leetcode.com/uploads/2024/05/08/examplerect0.png" style="padding: 10px; background: rgb(255, 255, 255); border-radius: 0.5rem; width: 279px; height: 198px;" /></p>
+
+<p>这个最小矩形的高度为 2，宽度为 3，因此面积为 <code>2 * 3 = 6</code>。</p>
+</div>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">grid = [[0,0],[1,0]]</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">1</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p><img alt="" src="https://assets.leetcode.com/uploads/2024/05/08/examplerect1.png" style="padding: 10px; background: rgb(255, 255, 255); border-radius: 0.5rem; width: 204px; height: 201px;" /></p>
+
+<p>这个最小矩形的高度和宽度都是 1，因此面积为 <code>1 * 1 = 1</code>。</p>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= grid.length, grid[i].length &lt;= 1000</code></li>
+	<li><code>grid[i][j]</code> 是 0 或 1。</li>
+	<li>输入保证 <code>grid</code> 中至少有一个 1 。</li>
+</ul>
+
+
+    
+## 解题方法：遍历求长方形位置
+
+一个横平竖直的长方形把所有的1覆盖掉，那么我们只需要遍历一次grid，求出所有1中最小的横坐标、最大的横坐标、最小的纵坐标、最大的纵坐标，即为长方形的left、right、up、down，$(r - l + 1) \times (d - u + 1)$即为所求。
+
++ 时间复杂度$O(size(grid))$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-22 21:18:33
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-22 21:21:31
+ */
+class Solution {
+public:
+    int minimumArea(vector<vector<int>>& grid) {
+        int l = 1000, r = 0, u = 1000, d = 0;
+        for (int i = 0; i < grid.size(); i++) {
+            for (int j = 0; j < grid[i].size(); j++) {
+                if (grid[i][j]) {
+                    l = min(l, j);
+                    r = max(r, j);
+                    u = min(u, i);
+                    d = max(d, i);
+                }
+            }
+        }
+        return (r - l + 1) * (d - u + 1);
+    }
+};
+```
+
+#### Python
+
+```python
+'''
+Author: LetMeFly
+Date: 2025-08-22 21:18:33
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-08-22 21:23:44
+'''
+from typing import List
+
+class Solution:
+    def minimumArea(self, grid: List[List[int]]) -> int:
+        l = u = 1000
+        r = d = 0
+        for i, line in enumerate(grid):
+            for j, g in enumerate(line):
+                if g:
+                    l = min(l, j)
+                    r = max(r, j)
+                    u = min(u, i)
+                    d = max(d, i)
+        return (r - l + 1) * (d - u + 1)
+```
+
+#### Java
+
+```java
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-22 21:18:33
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-22 21:33:05
+ */
+class Solution {
+    public int minimumArea(int[][] grid) {
+        int l = 1000, r = 0, u = 1000, d = 0;
+        for (int i = 0; i < grid.length; i++) {
+            for (int j = 0; j < grid[i].length; j++) {
+                if (grid[i][j] == 1) {
+                    l = Math.min(l, j);
+                    r = Math.max(r, j);
+                    u = Math.min(u, i);
+                    d = Math.max(d, i);
+                }
+            }
+        }
+        return (r - l + 1) * (d - u + 1);
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-22 21:18:33
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-22 21:30:00
+ */
+package main
+
+func minimumArea(grid [][]int) int {
+    l, r, u, d := 1000, 0, 1000, 0
+    for i, row := range grid {
+        for j, g := range row {
+            if g == 1 {
+                l = min(l, j)
+                r = max(r, j)
+                u = min(u, i)
+                d = max(d, i)
+            }
+        }
+    }
+    return (r - l + 1) * (d - u + 1)
+}
+```
+
+golang[第一次提交](https://leetcode.cn/problems/find-the-minimum-area-to-cover-all-ones-i/submissions/655617341/?envType=daily-question&envId=2025-08-22)leetcode出bug了
+
+#### Rust
+
+```rust
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-08-22 21:18:33
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-08-22 21:28:08
+ */
+impl Solution {
+    pub fn minimum_area(grid: Vec<Vec<i32>>) -> i32 {
+        let mut l: usize = 1000;
+        let mut r: usize = 0;
+        let mut u: usize = 1000;
+        let mut d: usize = 0;
+        for (i, row) in grid.into_iter().enumerate() {
+            for (j, g) in row.into_iter().enumerate() {
+                if g == 1 {
+                    l = l.min(j);
+                    r = r.max(j);
+                    u = u.min(i);
+                    d = d.max(i);
+                }
+            }
+        }
+        ((r - l + 1) * (d - u + 1)) as i32
+    }
+}
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/150618919)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2025/08/22/LeetCode%203195.%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%891%E7%9A%84%E6%9C%80%E5%B0%8F%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AFI/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
diff --git a/Solutions/Other-Japanese-LearningNotes.md b/Solutions/Other-Japanese-LearningNotes.md
