update: 添加问题“788.旋转数字”的代码(并更新其题解) (#1561)

* 788: WA.cpp (#1560) + en - 是整个x和之前不同

* 788: AC.cpp (#1560) - AC,100.00%,85.19%

* update: 添加问题“788.旋转数字”的代码(并更新其题解) (#1561)
2833: AC.cpp+py+java+go+rust (#1540)

cpp - AC,18.64%,27.12%
py - AC,100.00%,45.33%
java - AC,100.00%,81.25%
go - AC,100.00%,50.00%
rust - AC,100.00%,40.00%
rust.abs - AC,100.00%,60.00%

--- newSolutions.py ---
看下这个源码，实现以下新增功能：
1. 写源码的时候，如果最后一行不是空行，则添加一个空行（python的Solution后面若只有一行tab或几个空格，不算一个空行，仍需添加空行）
2. 写源码文件的时候，若go函数中默认是4个空格，改为tab
2. 源码到题解的时候，删掉最后的空行（如有）
3. 源码到题解文件的时候，将go的缩进tab改为4个空格
--- 为了鲁棒性保证，这次本feature不上线了(#1543) ---

Signed-off-by: LetMeFly666 <Tisfy@qq.com>

* Potential fix for pull request finding

Co-authored-by: Copilot Autofix powered by AI <175728472+Copilot@users.noreply.github.com>

* fix: 0->false

---------

Signed-off-by: LetMeFly666 <Tisfy@qq.com>
Co-authored-by: Copilot Autofix powered by AI <175728472+Copilot@users.noreply.github.com>

Author: LetMeFly666

Codes/0788-rotated-digits_20260502.cpp

@@ -0,0 +1,38 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-05-02 19:10:14
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-05-02 19:19:23
+ */
+#ifdef _DEBUG
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    static const int mask_diff = (1 << 2) | (1 << 5) | (1 << 6) | (1 << 9);
+    static const int mask_ok = mask_diff | (1 << 0) | (1 << 1) | (1 << 8);
+
+    bool ok(int n) {
+        bool has_diff = false;
+        while (n) {
+            int t = n % 10;
+            if (!((1 << t) & mask_ok)) {
+                return false;
+            }
+            if ((1 << t) & mask_diff) {
+                has_diff = true;
+            }
+            n /= 10;
+        }
+        return has_diff;
+    }
+public:
+    int rotatedDigits(int n) {
+        int ans = 0;
+        for (int i = 1; i <= n; i++) {
+            ans += ok(i);
+        }
+        return ans;
+    }
+};

Solutions/LeetCode 0788.旋转数字.md

@@ -1,7 +1,7 @@
 ---
 title: 788.旋转数字
 date: 2022-09-25 20:03:35
-tags: [题解, LeetCode, 中等, 数学, 动态规划, 暴力, 模拟]
+tags: [题解, LeetCode, 中等, 数学, 动态规划, 暴力, 模拟, 数位DP]
 categories: [题解, LeetCode]
 ---
 
@@ -94,5 +94,41 @@ public:
 };
 ```
 
+#### C++ - 写法2
+
+```cpp
+/*
+ * @LastEditTime: 2026-05-02 19:19:23
+ */
+class Solution {
+private:
+    static const int mask_diff = (1 << 2) | (1 << 5) | (1 << 6) | (1 << 9);
+    static const int mask_ok = mask_diff | (1 << 0) | (1 << 1) | (1 << 8);
+
+    bool ok(int n) {
+        bool has_diff = false;
+        while (n) {
+            int t = n % 10;
+            if (!((1 << t) & mask_ok)) {
+                return false;
+            }
+            if ((1 << t) & mask_diff) {
+                has_diff = true;
+            }
+            n /= 10;
+        }
+        return has_diff;
+    }
+public:
+    int rotatedDigits(int n) {
+        int ans = 0;
+        for (int i = 1; i <= n; i++) {
+            ans += ok(i);
+        }
+        return ans;
+    }
+};
+```
+
 > 同步发文于CSDN，原创不易，转载请附上[原文链接](https://blog.letmefly.xyz/2022/09/25/LeetCode%200788.%E6%97%8B%E8%BD%AC%E6%95%B0%E5%AD%97/)哦~
 > Tisfy：[https://letmefly.blog.csdn.net/article/details/127042249](https://letmefly.blog.csdn.net/article/details/127042249)

Solutions/Other-English-LearningNotes-SomeWords.md

@@ -1893,6 +1893,8 @@ categories: [自用]
 |distributorship|n. 分销权|
 |||
 |farmhand|n. 农场工人|
+|||
+|mob|n. 暴徒|
 
 + 这个web要是能设计得可以闭眼(完全不睁眼)键盘控制背单词就好了。
 + 也许可以加个AI用最近词编故事功能(返回接口中支持标注所使用单词高亮?)