update: 添加问题“2711.对角线上不同值的数量差”的代码和题解(#838)

LetMeFly666 · web-flow · commit 55da3efea67e · 2025-03-25T22:06:26.000+08:00
* leetcode: 2711 - Half - 跑步去了 max(mn)·mn版本 + Half的前缀和mn版本 Signed-off-by: LetMeFly666 <814114971@qq.com> * article: HTML tag of 《借助mitmproxy通过电子邮件隐式传输信息》 Signed-off-by: LetMeFly666 <814114971@qq.com> * 2711: AC.cpp - AC,75.00%,75.00% Signed-off-by: LetMeFly666 <814114971@qq.com> * 2711: WA.cpp Signed-off-by: LetMeFly666 <814114971@qq.com> * 2711: WA.cpp Signed-off-by: LetMeFly666 <814114971@qq.com> * 2711: AC.cpp - AC,100.00%,100.00% Signed-off-by: LetMeFly666 <814114971@qq.com> * 2711: AC.py Signed-off-by: LetMeFly666 <814114971@qq.com> * 2711: WA.Java Signed-off-by: LetMeFly666 <814114971@qq.com> * 2711: WA.Java Signed-off-by: LetMeFly666 <814114971@qq.com> * 2711: AC.Java - AC,82.76%,68.97% Signed-off-by: LetMeFly666 <814114971@qq.com> * 2711: 编译错误.Golang Line 32: Char 33: undefined: abs (solution.go) Signed-off-by: LetMeFly666 <814114971@qq.com> * 2711: AC.Golang - AC,100.00%,100.00% Signed-off-by: LetMeFly666 <814114971@qq.com> * update: 添加问题“2711.对角线上不同值的数量差”的代码和题解(#838) leetcode: 2711(双100%版本-C++/Go) article: HTML tag of 《借助mitmproxy通过电子邮件隐式传输信息》 Signed-off-by: LetMeFly666 <814114971@qq.com> * index_img: 2711 Signed-off-by: LetMeFly666 <814114971@qq.com> --------- Signed-off-by: LetMeFly666 <814114971@qq.com>
diff --git a/.commitmsg b/.commitmsg
@@ -1,4 +1,3 @@
-refactor: 周报->上周
-
-index_img: 借助mitmproxy通过电子邮件隐式传输信息
+leetcode: 2711(双100%版本-C++/Go)
 
+article: HTML tag of 《借助mitmproxy通过电子邮件隐式传输信息》
diff --git a/.nodeploy b/.nodeploy
diff --git a/.todo b/.todo
@@ -0,0 +1 @@
+设置VsCode括号不自动补全
diff --git a/Codes/2711-difference-of-number-of-distinct-values-on-diagonals.cpp b/Codes/2711-difference-of-number-of-distinct-values-on-diagonals.cpp
@@ -2,7 +2,7 @@
  * @Author: LetMeFly
  * @Date: 2025-03-25 16:52:02
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2025-03-25 16:53:14
+ * @LastEditTime: 2025-03-25 17:42:27
  */
 #ifdef _WIN32
 #include "_[1,2]toVector.h"
@@ -14,8 +14,16 @@ class Solution {
         vector<vector<int>> ans(grid.size(), vector<int>(grid[0].size()));
         for (int i = 0; i < grid.size(); i++) {
             for (int j = 0; j < grid[i].size(); j++) {
-                
+                unordered_set<int> l, r;
+                for (int k = 1; i - k >= 0 && j - k >= 0; k++) {
+                    l.insert(grid[i - k][j - k]);
+                }
+                for (int k = 1; i + k < grid.size() && j + k < grid[0].size(); k++) {
+                    r.insert(grid[i + k][j + k]);
+                }
+                ans[i][j] = abs(int(l.size() - r.size()));
             }
         }
+        return ans;
     }
 };
diff --git a/Codes/2711-difference-of-number-of-distinct-values-on-diagonals_QianZhuiHe.cpp b/Codes/2711-difference-of-number-of-distinct-values-on-diagonals_QianZhuiHe.cpp
@@ -0,0 +1,32 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-25 19:44:55
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-25 21:04:00
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    vector<vector<int>> differenceOfDistinctValues(vector<vector<int>>& grid) {
+        int n = grid.size(), m = grid[0].size();
+        vector<vector<int>> ans(n, vector<int>(m));
+        for (int k = 0; k < m + n - 1; k++) {
+            int i = k < m ? 0 : k - m + 1, j = k < m ? k : 0;
+            unordered_set<int> se;
+            int d = 0;
+            for (; i + d < n && j + d < m; d++) {
+                ans[i + d][j + d] = se.size();
+                se.insert(grid[i + d][j + d]);
+            }
+            se.clear();
+            for (d--; d >= 0; d--) {
+                ans[i + d][j + d] = abs(int(ans[i + d][j + d] - se.size()));
+                se.insert(grid[i + d][j + d]);
+            }
+        }
+        return ans;
+    }
+};
diff --git a/Codes/2711-difference-of-number-of-distinct-values-on-diagonals_WeiYunSuan-O1KongJian.cpp b/Codes/2711-difference-of-number-of-distinct-values-on-diagonals_WeiYunSuan-O1KongJian.cpp
@@ -0,0 +1,36 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-25 21:06:53
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-25 21:17:48
+ * @Description: AC,100.00%,100.00%
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+typedef long long ll;
+
+
+class Solution {
+public:
+    vector<vector<int>> differenceOfDistinctValues(vector<vector<int>>& grid) {
+        int n = grid.size(), m = grid[0].size();
+        vector<vector<int>> ans(n, vector<int>(m));
+        for (int k = 0; k < m + n - 1; k++) {
+            int i = k < m ? 0 : k - m + 1, j = k < m ? k : 0;
+            ll se = 0;
+            int d = 0;
+            for (; i + d < n && j + d < m; d++) {
+                ans[i + d][j + d] = __builtin_popcountll(se);
+                se |= 1LL << grid[i + d][j + d];
+            }
+            se = 0;
+            for (d--; d >= 0; d--) {
+                ans[i + d][j + d] = abs(ans[i + d][j + d] - __builtin_popcountll(se));
+                se |= 1LL << grid[i + d][j + d];
+            }
+        }
+        return ans;
+    }
+};
diff --git a/Codes/2711-difference-of-number-of-distinct-values-on-diagonals_WeiYunSuan-O1KongJian.go b/Codes/2711-difference-of-number-of-distinct-values-on-diagonals_WeiYunSuan-O1KongJian.go
@@ -0,0 +1,45 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-25 21:29:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-25 21:39:51
+ @Description: AC,100.00%,100.00%
+ */
+package main
+
+import "math/bits"
+
+func abs2711(a int) int {
+    if a < 0 {
+        return -a
+    }
+    return a
+}
+
+func differenceOfDistinctValues(grid [][]int) [][]int {
+    n, m := len(grid), len(grid[0])
+    ans := make([][]int, n)
+    for i := range ans {
+        ans[i] = make([]int, m)
+    }
+    for k := 0; k < m + n - 1; k++ {
+        var i, j int
+        if k < m {
+            i, j = 0, k
+        } else {
+            i, j = k - m + 1, 0
+        }
+        se := uint64(0)
+        d := 0
+        for ; i + d < n && j + d < m; d++ {
+            ans[i + d][j + d] = bits.OnesCount64(se)
+            se |= uint64(1) << grid[i + d][j + d]
+        }
+        se = 0
+        for d--; d >= 0; d-- {
+            ans[i + d][j + d] = abs2711(ans[i + d][j + d] - bits.OnesCount64(se))
+            se |= uint64(1) << grid[i + d][j + d]
+        }
+    }
+    return ans
+}
diff --git a/Codes/2711-difference-of-number-of-distinct-values-on-diagonals_WeiYunSuan-O1KongJian.java b/Codes/2711-difference-of-number-of-distinct-values-on-diagonals_WeiYunSuan-O1KongJian.java
@@ -0,0 +1,28 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-03-25 21:23:51
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-03-25 21:28:30
+ */
+class Solution {
+    public int[][] differenceOfDistinctValues(int[][] grid) {
+        int n = grid.length, m = grid[0].length;
+        int[][] ans = new int[n][m];
+        for (int k = 0; k < m + n - 1; k++) {
+            int i = k < m ? 0 : k - m + 1;
+            int j = k < m ? k : 0;
+            long se = 0;
+            int d = 0;
+            for (; i + d < n && j + d < m; d++) {
+                ans[i + d][j + d] = Long.bitCount(se);
+                se |= 1L << grid[i + d][j + d];
+            }
+            se = 0;
+            for (d--; d >= 0; d--) {
+                ans[i + d][j + d] = Math.abs(ans[i + d][j + d] - Long.bitCount(se));
+                se |= 1L << grid[i + d][j + d];
+            }
+        }
+        return ans;
+    }
+}
diff --git a/Codes/2711-difference-of-number-of-distinct-values-on-diagonals_WeiYunSuan-O1KongJian.py b/Codes/2711-difference-of-number-of-distinct-values-on-diagonals_WeiYunSuan-O1KongJian.py
@@ -0,0 +1,27 @@
+'''
+Author: LetMeFly
+Date: 2025-03-25 21:18:16
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-03-25 21:23:09
+'''
+from typing import List
+
+class Solution:
+    def differenceOfDistinctValues(self, grid: List[List[int]]) -> List[List[int]]:
+        n, m = len(grid), len(grid[0])
+        ans = [[0] * m for _ in range(n)]
+        for k in range(m + n - 1):
+            i = 0 if k < m else k - m + 1
+            j = k if k < m else 0
+            se = d = 0
+            while i + d < n and j + d < m:
+                ans[i + d][j + d] = se.bit_count()  # python10才有
+                se |= 1 << grid[i + d][j + d]
+                d += 1
+            se = 0
+            d -= 1
+            while d >= 0:
+                ans[i + d][j + d] = abs(ans[i + d][j + d] - se.bit_count())
+                se |= 1 << grid[i + d][j + d]
+                d -= 1
+        return ans
diff --git a/README.md b/README.md
@@ -810,6 +810,7 @@
 |2706.购买两块巧克力|简单|<a href="https://leetcode.cn/problems/buy-two-chocolates/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/12/29/LeetCode%202706.%E8%B4%AD%E4%B9%B0%E4%B8%A4%E5%9D%97%E5%B7%A7%E5%85%8B%E5%8A%9B/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/135295305" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/buy-two-chocolates/solutions/2584324/letmefly-2706gou-mai-liang-kuai-qiao-ke-vw4ai/" target="_blank">LeetCode题解</a>|
 |2708.一个小组的最大实力值|中等|<a href="https://leetcode.cn/problems/maximum-strength-of-a-group/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/09/04/LeetCode%202708.%E4%B8%80%E4%B8%AA%E5%B0%8F%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%AE%9E%E5%8A%9B%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/141884725" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-strength-of-a-group/solutions/2903918/letmefly-2708yi-ge-xiao-zu-de-zui-da-shi-6vng/" target="_blank">LeetCode题解</a>|
 |2710.移除字符串中的尾随零|简单|<a href="https://leetcode.cn/problems/remove-trailing-zeros-from-a-string/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/06/29/LeetCode%202710.%E7%A7%BB%E9%99%A4%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E5%B0%BE%E9%9A%8F%E9%9B%B6/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/140067468" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/remove-trailing-zeros-from-a-string/solutions/2825991/letmefly-2710yi-chu-zi-fu-chuan-zhong-de-r6ol/" target="_blank">LeetCode题解</a>|
+|2711.对角线上不同值的数量差|中等|<a href="https://leetcode.cn/problems/difference-of-number-of-distinct-values-on-diagonals/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/25/LeetCode%202711.%E5%AF%B9%E8%A7%92%E7%BA%BF%E4%B8%8A%E4%B8%8D%E5%90%8C%E5%80%BC%E7%9A%84%E6%95%B0%E9%87%8F%E5%B7%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146514119" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/difference-of-number-of-distinct-values-on-diagonals/solutions/3627916/letmefly-omnshi-jian-o1kong-jian-wei-yun-ey8o/" target="_blank">LeetCode题解</a>|
 |2717.半有序排列|简单|<a href="https://leetcode.cn/problems/semi-ordered-permutation/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/12/11/LeetCode%202717.%E5%8D%8A%E6%9C%89%E5%BA%8F%E6%8E%92%E5%88%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144412760" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/semi-ordered-permutation/solutions/3017796/letmefly-2717ban-you-xu-pai-lie-yi-ci-bi-8k4i/" target="_blank">LeetCode题解</a>|
 |2731.移动机器人|中等|<a href="https://leetcode.cn/problems/movement-of-robots/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/10/10/LeetCode%202731.%E7%A7%BB%E5%8A%A8%E6%9C%BA%E5%99%A8%E4%BA%BA/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/133758255" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/movement-of-robots/solutions/2476843/letmefly-2731yi-dong-ji-qi-ren-nao-jin-j-vwf2/" target="_blank">LeetCode题解</a>|
 |2734.执行子串操作后的字典序最小字符串|中等|<a href="https://leetcode.cn/problems/lexicographically-smallest-string-after-substring-operation/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/06/27/LeetCode%202734.%E6%89%A7%E8%A1%8C%E5%AD%90%E4%B8%B2%E6%93%8D%E4%BD%9C%E5%90%8E%E7%9A%84%E5%AD%97%E5%85%B8%E5%BA%8F%E6%9C%80%E5%B0%8F%E5%AD%97%E7%AC%A6%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/140027022" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/lexicographically-smallest-string-after-substring-operation/solutions/2824438/letmefly-2734zhi-xing-zi-chuan-cao-zuo-h-qcr8/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 2711.对角线上不同值的数量差.md b/Solutions/LeetCode 2711.对角线上不同值的数量差.md
diff --git a/Solutions/Other-Network-HowToSendHiddenMsgThroughEmailWithMitmproxy.md b/Solutions/Other-Network-HowToSendHiddenMsgThroughEmailWithMitmproxy.md
diff --git a/changelog b/changelog
