update: 添加问题“3027.人员站位的方案数II”的代码和题解 (#1114)

LetMeFly666 · Copilot · web-flow · commit 0b7992d5049b · 2025-09-05T13:45:43.000+08:00
* 3027: WA.cpp (#1112) input: [[1,1],[2,2],[3,3]] should: 0 output: 3 * 3027: WA.cpp (#1112) - 好吧，minY可以是10^{-9} input: [[2,5],[128653,-2370425]] should: 1 output: 0 * 3027: AC.cpp (#1112) - 然后就通过了 cpp - AC,46.07%,39.27% * feat: newSolution auto header (#1113) - half * 3027: AC.py+go | CE.java (#1112) - 思路是某日(9.3)中午小憩时想的 py - AC,36.15%,60.81% go - AC,49.06%,38.26% 9。3站方队？ * 3027: CE.java (#1112) * 3027: AC.java | WA.rust (#1112) java - AC,70.03%,83.93% * 3027: AC.rust (#1112) rust - AC,36.20%,7.97% * feat: newSolution auto header (#1112)(#1113) - dbg+foundReason * feat: newSolution auto header (#1112)(#1113) - finish 等下次再“回归”一下再试试吧 * update: 添加问题“3027.人员站位的方案数II”的代码和题解 (#1114) Signed-off-by: LetMeFly666 <814114971@qq.com> * words: en(jp) today (#1112) * feat: newSolution auto header (#1112)(#1113) - clean up * fix: a maybe-won't-happened IndexError: list index out of range 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/.vscode/settings.json b/.vscode/settings.json
@@ -94,7 +94,17 @@
         "__locale": "cpp",
         "ios": "cpp",
         "__config": "cpp",
-        "__bit_reference": "cpp"
+        "__bit_reference": "cpp",
+        "any": "cpp",
+        "barrier": "cpp",
+        "latch": "cpp",
+        "numbers": "cpp",
+        "semaphore": "cpp",
+        "variant": "cpp",
+        "__node_handle": "cpp",
+        "__verbose_abort": "cpp",
+        "execution": "cpp",
+        "print": "cpp"
     },
     "editor.mouseWheelZoom": true,
     "workbench.tree.enableStickyScroll": true,
diff --git a/Codes/3027-find-the-number-of-ways-to-place-people-ii.cpp b/Codes/3027-find-the-number-of-ways-to-place-people-ii.cpp
@@ -0,0 +1,29 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-05 09:55:20
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-05 10:05:44
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int numberOfPairs(vector<vector<int>>& points) {
+        sort(points.begin(), points.end(), [](const vector<int>& a, const vector<int>& b) {
+            return a[0] == b[0] ? a[1] > b[1] : a[0] < b[0];
+        });
+        int ans = 0;
+        for (int i = 0; i < points.size(); i++) {
+            int mxY = -1000000001;
+            for (int j = i + 1; j < points.size(); j++) {
+                if (points[j][1] > mxY && points[j][1] <= points[i][1]) {
+                    ans++;
+                    mxY = points[j][1];
+                }
+            }
+        }
+        return ans;
+    }
+};
diff --git a/Codes/3027-find-the-number-of-ways-to-place-people-ii.go b/Codes/3027-find-the-number-of-ways-to-place-people-ii.go
@@ -0,0 +1,28 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-05 09:55:20
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-05 10:40:12
+ */
+package main
+
+import "sort"
+
+func numberOfPairs(points [][]int) (ans int) {
+    sort.Slice(points, func(i int, j int) bool {
+        if points[i][0] == points[j][0] {
+            return points[i][1] > points[j][1]
+        }
+        return points[i][0] < points[j][0]
+    })
+    for i := range points {
+        mxY := -1000000001
+        for j := i + 1; j < len(points); j++ {
+            if points[j][1] > mxY && points[j][1] <= points[i][1] {
+                mxY = points[j][1]
+                ans++
+            }
+        }
+    }
+    return
+}
diff --git a/Codes/3027-find-the-number-of-ways-to-place-people-ii.java b/Codes/3027-find-the-number-of-ways-to-place-people-ii.java
@@ -0,0 +1,24 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-05 09:55:20
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-05 10:44:46
+ */
+import java.util.Arrays;
+
+class Solution {
+    public int numberOfPairs(int[][] points) {
+        Arrays.sort(points, (a, b) -> a[0] == b[0] ? b[1] - a[1] : a[0] - b[0]);
+        int ans = 0;
+        for (int i = 0; i < points.length; i++) {
+            int mxY = -1000000001;
+            for (int j = i + 1; j < points.length; j++) {
+                if (points[j][1] > mxY && points[j][1] <= points[i][1]) {
+                    mxY = points[j][1];
+                    ans++;
+                }
+            }
+        }
+        return ans;
+    }
+}
diff --git a/Codes/3027-find-the-number-of-ways-to-place-people-ii.py b/Codes/3027-find-the-number-of-ways-to-place-people-ii.py
@@ -0,0 +1,19 @@
+'''
+Author: LetMeFly
+Date: 2025-09-05 09:55:20
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-09-05 10:35:32
+'''
+from typing import List
+
+class Solution:
+    def numberOfPairs(self, points: List[List[int]]) -> int:
+        points.sort(key=lambda x: (x[0], -x[1]))
+        ans = 0
+        for i in range(len(points)):
+            mxY = -1000000001
+            for j in range(i + 1, len(points)):
+                if mxY < points[j][1] <= points[i][1]:
+                    mxY = points[j][1]
+                    ans += 1
+        return ans
diff --git a/Codes/3027-find-the-number-of-ways-to-place-people-ii.rs b/Codes/3027-find-the-number-of-ways-to-place-people-ii.rs
@@ -0,0 +1,28 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-05 09:55:20
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-05 10:49:59
+ */
+impl Solution {
+    pub fn number_of_pairs(mut points: Vec<Vec<i32>>) -> i32 {  // 想原地sort points的话记得在points前面加上mut
+        points.sort_by(|a, b| {
+            if a[0] == b[0] {
+                b[1].cmp(&a[1])
+            } else {
+                a[0].cmp(&b[0])
+            }
+        });
+        let mut ans: i32 = 0;
+        for i in 0..points.len() {
+            let mut mx_y: i32 = -1000000001;
+            for j in (i+1)..points.len() {
+                if points[j][1] > mx_y && points[j][1] <= points[i][1] {
+                    mx_y = points[j][1];
+                    ans += 1;
+                }
+            }
+        }
+        ans
+    }
+}
diff --git a/Codes/lib.rs b/Codes/lib.rs
@@ -5,4 +5,4 @@
  * @LastEditTime: 2025-08-31 19:14:48
  */
 pub struct Solution;
-include!("3516-find-closest-person.rs");  // 这个fileName是会被脚本替换掉的
+include!("3027-find-the-number-of-ways-to-place-people-ii.rs");  // 这个fileName是会被脚本替换掉的
diff --git a/README.md b/README.md
@@ -922,6 +922,7 @@
 |3019.按键变更的次数|简单|<a href="https://leetcode.cn/problems/number-of-changing-keys/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/01/07/LeetCode%203019.%E6%8C%89%E9%94%AE%E5%8F%98%E6%9B%B4%E7%9A%84%E6%AC%A1%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144983704" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/number-of-changing-keys/solutions/3040949/letmefly-3019an-jian-bian-geng-de-ci-shu-pgzx/" target="_blank">LeetCode题解</a>|
 |3024.三角形类型|简单|<a href="https://leetcode.cn/problems/type-of-triangle/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/19/LeetCode%203024.%E4%B8%89%E8%A7%92%E5%BD%A2%E7%B1%BB%E5%9E%8B/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/148061722" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/type-of-triangle/solutions/3680826/letmefly-3024san-jiao-xing-lei-xing-shou-q46h/" target="_blank">LeetCode题解</a>|
 |3025.人员站位的方案数I|中等|<a href="https://leetcode.cn/problems/find-the-number-of-ways-to-place-people-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/09/02/LeetCode%203025.%E4%BA%BA%E5%91%98%E7%AB%99%E4%BD%8D%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/151119511" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-number-of-ways-to-place-people-i/solutions/3770378/letmefly-3025ren-yuan-zhan-wei-de-fang-a-02tk/" target="_blank">LeetCode题解</a>|
+|3027.人员站位的方案数II|困难|<a href="https://leetcode.cn/problems/find-the-number-of-ways-to-place-people-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/09/05/LeetCode%203027.%E4%BA%BA%E5%91%98%E7%AB%99%E4%BD%8D%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/151220862" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-number-of-ways-to-place-people-ii/solutions/3772911/letmefly-3027ren-yuan-zhan-wei-de-fang-a-03g4/" target="_blank">LeetCode题解</a>|
 |3033.修改矩阵|简单|<a href="https://leetcode.cn/problems/modify-the-matrix/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/07/05/LeetCode%203033.%E4%BF%AE%E6%94%B9%E7%9F%A9%E9%98%B5/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/140219034" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/modify-the-matrix/solutions/2832430/letmefly-3033xiu-gai-ju-zhen-yuan-di-xiu-e0cy/" target="_blank">LeetCode题解</a>|
 |3038.相同分数的最大操作数目I|简单|<a href="https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/06/07/LeetCode%203038.%E7%9B%B8%E5%90%8C%E5%88%86%E6%95%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E6%93%8D%E4%BD%9C%E6%95%B0%E7%9B%AEI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139535702" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-i/solutions/2804245/letmefly-3038xiang-tong-fen-shu-de-zui-d-dkj7/" target="_blank">LeetCode题解</a>|
 |3046.分割数组|简单|<a href="https://leetcode.cn/problems/split-the-array/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/12/28/LeetCode%203046.%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144789679" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/split-the-array/solutions/3032725/letmefly-3046fen-ge-shu-zu-ji-shu-by-tis-33vv/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 3027.人员站位的方案数II.md b/Solutions/LeetCode 3027.人员站位的方案数II.md
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
diff --git a/ifWithList.py b/ifWithList.py
diff --git a/newSolution.py b/newSolution.py
