update: 添加问题“3531.统计被覆盖的建筑”的代码和题解 (#1218)

LetMeFly666 · LetMeFly666 · commit 1cf356ce8948 · 2025-12-11T19:35:23.000+08:00
3531: AC.cpp+py+go+java+rust (#1217) cpp(1e5version) - AC,27.12%,27.12% cpp - AC,55.93%,55.93% py - AC,60.46%,86.05% go - AC,44.44%,33.33% rust - AC,50.00%,-% 是不是这道题通过者还比较少（看超越百分比有感） Signed-off-by: LetMeFly666 <814114971@qq.com>
diff --git a/.commitmsg b/.commitmsg
@@ -0,0 +1,9 @@
+3531: AC.cpp+py+go+java+rust (#1217)
+
+cpp(1e5version) - AC,27.12%,27.12%
+cpp - AC,55.93%,55.93%
+py - AC,60.46%,86.05%
+go - AC,44.44%,33.33%
+rust - AC,50.00%,-%
+
+是不是这道题通过者还比较少（看超越百分比有感）
diff --git a/Codes/3531-count-covered-buildings.cpp b/Codes/3531-count-covered-buildings.cpp
@@ -0,0 +1,29 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-11 13:14:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-11 13:23:40
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int countCoveredBuildings(int n, vector<vector<int>>& buildings) {
+        vector<int> xm(100001, 100001), xM(100001), ym(100001, 100001), yM(100001);
+        for (vector<int>& building : buildings) {
+            int x = building[0], y = building[1];
+            xm[x] = min(xm[x], y);
+            xM[x] = max(xM[x], y);
+            ym[y] = min(ym[y], x);
+            yM[y] = max(yM[y], x);
+        }
+        int ans = 0;
+        for (vector<int>& building : buildings) {
+            int x = building[0], y = building[1];
+            ans += xm[x] < y && y < xM[x] && ym[y] < x && x < yM[y];
+        }
+        return ans;
+    }
+};
diff --git a/Codes/3531-count-covered-buildings.go b/Codes/3531-count-covered-buildings.go
@@ -0,0 +1,35 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-11 13:14:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-11 13:35:38
+ */
+package main
+
+func countCoveredBuildings(n int, buildings [][]int) (ans int) {
+    n++
+    xm := make([]int, n)
+    xM := make([]int, n)
+    ym := make([]int, n)
+    yM := make([]int, n)
+    for i := range xm {
+        xm[i] = n
+        ym[i] = n
+    }
+
+    for _, building := range buildings {
+        x, y := building[0], building[1]
+        xm[x] = min(xm[x], y)
+        xM[x] = max(xM[x], y)
+        ym[y] = min(ym[y], x)
+        yM[y] = max(yM[y], x)
+    }
+
+    for _, building := range buildings {
+        x, y := building[0], building[1]
+        if xm[x] < y && y < xM[x] && ym[y] < x && x < yM[y] {
+            ans++
+        }
+    }
+    return
+}
diff --git a/Codes/3531-count-covered-buildings.java b/Codes/3531-count-covered-buildings.java
@@ -0,0 +1,36 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-11 13:14:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-11 13:40:24
+ */
+import java.util.Arrays;
+
+class Solution {
+    public int countCoveredBuildings(int n, int[][] buildings) {
+        n++;
+        int[] xm = new int[n];
+        int[] xM = new int[n];
+        int[] ym = new int[n];
+        int[] yM = new int[n];
+        Arrays.fill(xm, n);
+        Arrays.fill(ym, n);
+
+        for (int[] building : buildings) {
+            int x = building[0], y = building[1];
+            xm[x] = Math.min(xm[x], y);
+            xM[x] = Math.max(xM[x], y);
+            ym[y] = Math.min(ym[y], x);
+            yM[y] = Math.max(yM[y], x);
+        }
+
+        int ans = 0;
+        for (int[] building : buildings) {
+            int x = building[0], y = building[1];
+            if (xm[x] < y && y < xM[x] && ym[y] < x && x < yM[y]) {
+                ans++;
+            }
+        }
+        return ans;
+    }
+}
diff --git a/Codes/3531-count-covered-buildings.py b/Codes/3531-count-covered-buildings.py
@@ -0,0 +1,24 @@
+'''
+Author: LetMeFly
+Date: 2025-12-11 13:14:46
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-12-11 13:27:34
+'''
+from typing import List
+
+class Solution:
+    def countCoveredBuildings(self, n: int, buildings: List[List[int]]) -> int:
+        n += 1
+        xm = [n] * n
+        xM = [0] * n
+        ym = [n] * n
+        yM = [0] * n
+        for x, y in buildings:
+            xm[x] = min(xm[x], y)
+            xM[x] = max(xM[x], y)
+            ym[y] = min(ym[y], x)
+            yM[y] = max(yM[y], x)
+        ans = 0
+        for x, y in buildings:
+            ans += xm[x] < y < xM[x] and ym[y] < x < yM[y]
+        return ans
diff --git a/Codes/3531-count-covered-buildings.rs b/Codes/3531-count-covered-buildings.rs
@@ -0,0 +1,34 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-11 13:14:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-11 13:48:09
+ */
+impl Solution {
+    pub fn count_covered_buildings(mut n: i32, buildings: Vec<Vec<i32>>) -> i32 {
+        n += 1;
+        let mut xm: Vec<i32> = vec![n; n as usize];
+        let mut xM: Vec<i32> = vec![0; n as usize];
+        let mut ym: Vec<i32> = vec![n; n as usize];
+        let mut yM: Vec<i32> = vec![0; n as usize];
+
+        for building in buildings.iter() {
+            let x: i32 = building[0];
+            let y: i32 = building[1];
+            xm[x as usize] = xm[x as usize].min(y);
+            xM[x as usize] = xM[x as usize].max(y);
+            ym[y as usize] = ym[y as usize].min(x);
+            yM[y as usize] = yM[y as usize].max(x);
+        }
+
+        let mut ans: i32 = 0;
+        for building in buildings.iter() {
+            let x: i32 = building[0];
+            let y: i32 = building[1];
+            if xm[x as usize] < y && y < xM[x as usize] && ym[y as usize] < x && x < yM[y as usize] {
+                ans += 1;
+            }
+        }
+        ans
+    }
+}
diff --git a/Codes/3531-count-covered-buildings_better.cpp b/Codes/3531-count-covered-buildings_better.cpp
@@ -0,0 +1,30 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-11 13:14:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-11 13:23:40
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int countCoveredBuildings(int n, vector<vector<int>>& buildings) {
+        n++;
+        vector<int> xm(n, n), xM(n), ym(n, n), yM(n);
+        for (vector<int>& building : buildings) {
+            int x = building[0], y = building[1];
+            xm[x] = min(xm[x], y);
+            xM[x] = max(xM[x], y);
+            ym[y] = min(ym[y], x);
+            yM[y] = max(yM[y], x);
+        }
+        int ans = 0;
+        for (vector<int>& building : buildings) {
+            int x = building[0], y = building[1];
+            ans += xm[x] < y && y < xM[x] && ym[y] < x && x < yM[y];
+        }
+        return ans;
+    }
+};
diff --git a/Codes/lib.rs b/Codes/lib.rs
@@ -5,4 +5,4 @@
  * @LastEditTime: 2025-11-01 22:18:35
  */
 pub struct Solution;
-include!("3577-count-the-number-of-computer-unlocking-permutations.rs");  // 这个fileName是会被脚本替换掉的
+include!("3531-count-covered-buildings.rs");  // 这个fileName是会被脚本替换掉的
diff --git a/README.md b/README.md
@@ -1052,6 +1052,7 @@
 |3494.酿造药水需要的最少总时间|中等|<a href="https://leetcode.cn/problems/find-the-minimum-amount-of-time-to-brew-potions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/10/09/LeetCode%203494.%E9%85%BF%E9%80%A0%E8%8D%AF%E6%B0%B4%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E5%B0%91%E6%80%BB%E6%97%B6%E9%97%B4/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/152847907" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-minimum-amount-of-time-to-brew-potions/solutions/3801656/letmefly-3494niang-zao-yao-shui-xu-yao-d-bjxv/" target="_blank">LeetCode题解</a>|
 |3508.设计路由器|中等|<a href="https://leetcode.cn/problems/implement-router/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/09/20/LeetCode%203508.%E8%AE%BE%E8%AE%A1%E8%B7%AF%E7%94%B1%E5%99%A8/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/151901838" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/implement-router/solutions/3787451/letmefly-3508she-ji-lu-you-qi-stltao-stl-ehkf/" target="_blank">LeetCode题解</a>|
 |3516.找到最近的人|简单|<a href="https://leetcode.cn/problems/find-closest-person/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/09/04/LeetCode%203516.%E6%89%BE%E5%88%B0%E6%9C%80%E8%BF%91%E7%9A%84%E4%BA%BA/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/151184074" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-closest-person/solutions/3772009/letmefly-3516zhao-dao-zui-jin-de-ren-ji-8rlbz/" target="_blank">LeetCode题解</a>|
+|3531.统计被覆盖的建筑|中等|<a href="https://leetcode.cn/problems/count-covered-buildings/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/12/11/LeetCode%203531.%E7%BB%9F%E8%AE%A1%E8%A2%AB%E8%A6%86%E7%9B%96%E7%9A%84%E5%BB%BA%E7%AD%91/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/155824933" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-covered-buildings/solutions/3854864/letmefly-3531tong-ji-bei-fu-gai-de-jian-9kgng/" target="_blank">LeetCode题解</a>|
 |3541.找到频率最高的元音和辅音|简单|<a href="https://leetcode.cn/problems/find-most-frequent-vowel-and-consonant/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/09/13/LeetCode%203541.%E6%89%BE%E5%88%B0%E9%A2%91%E7%8E%87%E6%9C%80%E9%AB%98%E7%9A%84%E5%85%83%E9%9F%B3%E5%92%8C%E8%BE%85%E9%9F%B3/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/151653999" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-most-frequent-vowel-and-consonant/solutions/3780744/letmefly-3541zhao-dao-pin-lu-zui-gao-de-yv5vs/" target="_blank">LeetCode题解</a>|
 |3577.统计计算机解锁顺序排列数|中等|<a href="https://leetcode.cn/problems/count-the-number-of-computer-unlocking-permutations/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/12/10/LeetCode%203577.%E7%BB%9F%E8%AE%A1%E8%AE%A1%E7%AE%97%E6%9C%BA%E8%A7%A3%E9%94%81%E9%A1%BA%E5%BA%8F%E6%8E%92%E5%88%97%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/155791805" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-the-number-of-computer-unlocking-permutations/solutions/3854206/letmefly-3577tong-ji-ji-suan-ji-jie-suo-5b6b8/" target="_blank">LeetCode题解</a>|
 |3583.统计特殊三元组|中等|<a href="https://leetcode.cn/problems/count-special-triplets/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/12/09/LeetCode%203583.%E7%BB%9F%E8%AE%A1%E7%89%B9%E6%AE%8A%E4%B8%89%E5%85%83%E7%BB%84/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/155754955" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-special-triplets/solutions/3853381/letmefly-3583tong-ji-te-shu-san-yuan-zu-cdnx3/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 3531.统计被覆盖的建筑.md b/Solutions/LeetCode 3531.统计被覆盖的建筑.md
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
diff --git a/tryGoPy/ReLeetcode/processHistory.py b/tryGoPy/ReLeetcode/processHistory.py
