update: 添加问题“762.二进制表示中质数个计算置位”的代码和题解 + docs: github cli + windows credentials remove (#1403)

762: AC.cpp (#1402) - AC,67.64%,43.37% + en

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

Author: LetMeFly666

.commitTitleExtra

@@ -0,0 +1 @@
+ + docs: github cli + windows credentials remove

.commitmsg

@@ -0,0 +1 @@
+762: AC.cpp (#1402) - AC,67.64%,43.37% + en

Codes/0762-prime-number-of-set-bits-in-binary-representation_20260221.cpp

@@ -0,0 +1,25 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-02-21 12:13:32
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-02-21 12:23:11
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+// THIS CANNOT BE ACCEPTED
+class Solution {
+private:
+    constexpr static int mask = 665772;
+public:
+    int countPrimeSetBits(int left, int right) {
+        int ans = 0;
+        for (int i = left; i <= right; i++) {
+            if (mask && 1 << __builtin_popcount(i)) {
+                ans++;
+            }
+        }
+        return ans;
+    }
+};

Codes/0762-prime-number-of-set-bits-in-binary-representation_20260221.py

@@ -0,0 +1,32 @@
+'''
+Author: LetMeFly
+Date: 2026-02-21 12:13:32
+LastEditors: LetMeFly.xyz
+LastEditTime: 2026-02-21 12:22:44
+'''
+max_length = 0
+while 1 << max_length < 1000000:
+    max_length += 1
+print(f'max_length: {max_length}, 1 << {max_length} = {1 << max_length}')
+
+primes = []
+for i in range(2, max_length + 1):
+    isnot = False
+    for j in range(2, i):
+        if i % j == 0:
+            isnot = True
+            break
+    if not isnot:
+        primes.append(i)
+print(f'primes: {primes}')
+
+mask = 0
+for p in primes:
+    mask |= 1 << p
+print(f'mask: {mask}')
+
+"""
+max_length: 20, 1 << 20 = 1048576
+primes: [2, 3, 5, 7, 11, 13, 17, 19]
+mask: 665772
+"""

Codes/0762-prime-number-of-set-bits-in-binary-representation_20260221_AC.cpp

@@ -0,0 +1,25 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-02-21 12:13:32
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-02-21 12:28:09
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    constexpr static int mask = 665772;
+public:
+    int countPrimeSetBits(int left, int right) {
+        int ans = 0;
+        for (int i = left; i <= right; i++) {
+            if (mask & (1 << __builtin_popcount(i))) {
+                // printf("i = %d, cnt1 = %d\n", i, __builtin_popcount(i));
+                ans++;
+            }
+        }
+        return ans;
+    }
+};

README.md

@@ -2,7 +2,7 @@
  * @Author: LetMeFly
  * @Date: 2022-05-19 18:48:53
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2026-02-03 22:57:38
+ * @LastEditTime: 2026-02-21 11:12:11
 -->
 # LetLeet Blog
 
@@ -151,6 +151,7 @@
 |Windows - Windows10绕过登录（修改）密码登录：未验证|<a href="https://blog.letmefly.xyz/2023/07/05/Other-Windows-LoginWindowsWithoutPassword/">本平台博客</a>|无|
 |Windows(奇思妙想) - 通过ssh打开带有图形界面的程序 - 一种通过计划任务的曲折实现方式|<a href="https://blog.letmefly.xyz/2025/02/21/Other-Windows-OpenUIbySSH">本平台博客</a>|<a href="https://letmefly.blog.csdn.net/article/details/145786262">CSDN博客</a>|
 |Windows程序互斥锁 - 一个程序同时仅允许运行一个实例|<a href="https://blog.letmefly.xyz/2024/02/17/Other-Windows-ProgramMutex-onlyRun1instanceMeanwhile/">本平台博客</a>|<a href="https://letmefly.blog.csdn.net/article/details/136139822">CSDN博客</a>|
+|Windows - VsCode导致Windows凭据过多之一键删除|<a href="https://blog.letmefly.xyz/2026/02/21/Other-Windows-RemoveExcessWindowsCredentialsGeneratedByVsCode/">本平台博客</a>|<a href="https://letmefly.blog.csdn.net/article/details/158262243">CSDN博客</a>|
 |Windows - URL Scheme - 在Windows上无管理员权限为你的程序添加URL Scheme|<a href="https://blog.letmefly.xyz/2024/02/08/Other-Windows-URLScheme-Define1URLSchemeForYourApplicationWithoutUACOnWindows/">本平台博客</a>|<a href="https://letmefly.blog.csdn.net/article/details/136083203">CSDN博客</a>|
 |Windows - UWP - 为UWP应用创建桌面快捷方式|<a href="https://blog.letmefly.xyz/2023/08/12/Other-Windows-UWP-createShortcutOnDesktop/">本平台博客</a>|<a href="https://letmefly.blog.csdn.net/article/details/132254567">CSDN博客</a>|
 |Windows - UWP - 网络不好的情况下安装（微软商店）MicrosoftStore的应用|<a href="https://blog.letmefly.xyz/2023/08/13/Other-Windows-UWP-InstallingUWPinMSStoreUsingTroubleInternet/">本平台博客</a>|<a href="https://letmefly.blog.csdn.net/article/details/132257018">CSDN博客</a>|
@@ -410,6 +411,7 @@
 |0754.到达终点数字|中等|<a href="https://leetcode.cn/problems/reach-a-number/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/11/04/LeetCode%200754.%E5%88%B0%E8%BE%BE%E7%BB%88%E7%82%B9%E6%95%B0%E5%AD%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/127684453" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/reach-a-number/solutions/1947583/letmefly-754dao-da-zhong-dian-shu-zi-by-z6q4r/" target="_blank">LeetCode题解</a>|
 |0756.金字塔转换矩阵|中等|<a href="https://leetcode.cn/problems/pyramid-transition-matrix/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/12/29/LeetCode%200756.%E9%87%91%E5%AD%97%E5%A1%94%E8%BD%AC%E6%8D%A2%E7%9F%A9%E9%98%B5/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/156400643" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/pyramid-transition-matrix/solutions/3868875/letmefly-756jin-zi-ta-zhuan-huan-ju-zhen-ldxx/" target="_blank">LeetCode题解</a>|
 |0761.特殊的二进制字符串|困难|<a href="https://leetcode.cn/problems/special-binary-string/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/02/20/LeetCode%200761.%E7%89%B9%E6%AE%8A%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%97%E7%AC%A6%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/158235045" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/special-binary-string/solutions/3905163/letmefly-761te-shu-de-er-jin-zhi-zi-fu-c-q26c/" target="_blank">LeetCode题解</a>|
+|0762.二进制表示中质数个计算置位|简单|<a href="https://leetcode.cn/problems/prime-number-of-set-bits-in-binary-representation/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/02/21/LeetCode%200762.%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA%E4%B8%AD%E8%B4%A8%E6%95%B0%E4%B8%AA%E8%AE%A1%E7%AE%97%E7%BD%AE%E4%BD%8D/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/158262877" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/prime-number-of-set-bits-in-binary-representation/solutions/3905643/letmefly-762er-jin-zhi-biao-shi-zhong-zh-d3jl/" target="_blank">LeetCode题解</a>|
 |0765.情侣牵手|困难|<a href="https://leetcode.cn/problems/couples-holding-hands/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/11/11/LeetCode%200765.%E6%83%85%E4%BE%A3%E7%89%B5%E6%89%8B/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/134355602" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/couples-holding-hands/solutions/2522691/letmefly-765qing-lu-qian-shou-yan-du-you-nt6z/" target="_blank">LeetCode题解</a>|
 |0769.最多能完成排序的块|中等|<a href="https://leetcode.cn/problems/max-chunks-to-make-sorted/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/10/13/LeetCode%200769.%E6%9C%80%E5%A4%9A%E8%83%BD%E5%AE%8C%E6%88%90%E6%8E%92%E5%BA%8F%E7%9A%84%E5%9D%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/127295302" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/max-chunks-to-make-sorted/solution/letmefly-769zui-duo-neng-wan-cheng-pai-x-pzsz/" target="_blank">LeetCode题解</a>|
 |0771.宝石与石头|简单|<a href="https://leetcode.cn/problems/jewels-and-stones/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/07/24/LeetCode%200771.%E5%AE%9D%E7%9F%B3%E4%B8%8E%E7%9F%B3%E5%A4%B4/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/131888350" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/jewels-and-stones/solutions/2356279/letmefly-771bao-shi-yu-shi-tou-by-tisfy-fqmc/" target="_blank">LeetCode题解</a>|

Solutions/LeetCode 0762.二进制表示中质数个计算置位.md

@@ -0,0 +1,131 @@
+---
+title: 762.二进制表示中质数个计算置位：位运算（mask O(1)判断）
+date: 2026-02-21 12:30:01
+tags: [题解, LeetCode, 简单, 位运算, 数学, 质数]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】762.二进制表示中质数个计算置位：位运算（mask O(1)判断）
+
+力扣题目链接：[https://leetcode.cn/problems/prime-number-of-set-bits-in-binary-representation/](https://leetcode.cn/problems/prime-number-of-set-bits-in-binary-representation/)
+
+<p>给你两个整数&nbsp;<code>left</code>&nbsp;和&nbsp;<code>right</code> ，在闭区间 <code>[left, right]</code>&nbsp;范围内，统计并返回 <strong>计算置位位数为质数</strong> 的整数个数。</p>
+
+<p><strong>计算置位位数</strong> 就是二进制表示中 <code>1</code> 的个数。</p>
+
+<ul>
+	<li>例如， <code>21</code>&nbsp;的二进制表示&nbsp;<code>10101</code>&nbsp;有 <code>3</code> 个计算置位。</li>
+</ul>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>left = 6, right = 10
+<strong>输出：</strong>4
+<strong>解释：</strong>
+6 -&gt; 110 (2 个计算置位，2 是质数)
+7 -&gt; 111 (3 个计算置位，3 是质数)
+9 -&gt; 1001 (2 个计算置位，2 是质数)
+10-&gt; 1010 (2 个计算置位，2 是质数)
+共计 4 个计算置位为质数的数字。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>left = 10, right = 15
+<strong>输出：</strong>5
+<strong>解释：</strong>
+10 -&gt; 1010 (2 个计算置位, 2 是质数)
+11 -&gt; 1011 (3 个计算置位, 3 是质数)
+12 -&gt; 1100 (2 个计算置位, 2 是质数)
+13 -&gt; 1101 (3 个计算置位, 3 是质数)
+14 -&gt; 1110 (3 个计算置位, 3 是质数)
+15 -&gt; 1111 (4 个计算置位, 4 不是质数)
+共计 5 个计算置位为质数的数字。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= left &lt;= right &lt;= 10<sup>6</sup></code></li>
+	<li><code>0 &lt;= right - left &lt;= 10<sup>4</sup></code></li>
+</ul>
+
+
+    
+## 解题方法：预处理
+
+写个脚本，计算$10^6$范围内二进制下最多有多少个1：$1^{20}=1048576$
+
+再算出来其中都有哪些是质数：$[2, 3, 5, 7, 11, 13, 17, 19]$
+
+再使用一个整数二进制下的每一位代表一个数是否是质数。
+
+```python
+'''
+LastEditTime: 2026-02-21 12:22:44
+'''
+max_length = 0
+while 1 << max_length < 1000000:
+    max_length += 1
+print(f'max_length: {max_length}, 1 << {max_length} = {1 << max_length}')
+
+primes = []
+for i in range(2, max_length + 1):
+    isnot = False
+    for j in range(2, i):
+        if i % j == 0:
+            isnot = True
+            break
+    if not isnot:
+        primes.append(i)
+print(f'primes: {primes}')
+
+mask = 0
+for p in primes:
+    mask |= 1 << p
+print(f'mask: {mask}')
+
+"""
+max_length: 20, 1 << 20 = 1048576
+primes: [2, 3, 5, 7, 11, 13, 17, 19]
+mask: 665772
+"""
+```
+
++ 时间复杂度$O(right - left)$
++ 空间复杂度$O(N\log N)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @LastEditTime: 2026-02-21 12:28:09
+ */
+class Solution {
+private:
+    constexpr static int mask = 665772;
+public:
+    int countPrimeSetBits(int left, int right) {
+        int ans = 0;
+        for (int i = left; i <= right; i++) {
+            if (mask & (1 << __builtin_popcount(i))) {
+                // printf("i = %d, cnt1 = %d\n", i, __builtin_popcount(i));
+                ans++;
+            }
+        }
+        return ans;
+    }
+};
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/158262877)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2026/02/21/LeetCode%200762.%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA%E4%B8%AD%E8%B4%A8%E6%95%B0%E4%B8%AA%E8%AE%A1%E7%AE%97%E7%BD%AE%E4%BD%8D/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)

Solutions/Other-Accumulation-SomeTips.md

@@ -308,6 +308,36 @@ git fetch machine1
 git config receive.denyCurrentBranch updateInstead
 ```
 
+### About Github GH(Github CLI)
+
+官网：[cli.github.com](https://cli.github.com/)
+
+安装：
+
+* Mac: 
+
+    ```bash
+    brew install gh
+    # brew upgrade gh
+    ```
+
+* Windows:
+
+    [Releases](https://github.com/cli/cli/releases)点`show all xx asserts`，找到`GitHub CLI 2.87.2 windows amd64`下载并添加到环境变量path中；或者找`GitHub CLI 2.87.2 windows amd64 installer`傻瓜式下一步安装。
+
+登录：
+
+```bash
+gh auth login
+# 可登录多账号，之后使用gh switch USERNAME切换
+```
+
+添加project权限：
+
+```bash
+gh auth refresh -s project
+```
+
 ## About HTML
 
 ### 空白字符

Solutions/Other-English-LearningNotes-SomeWords.md

@@ -1825,6 +1825,8 @@ categories: [自用]
 |infringe|v. 侵犯，违背|
 |||
 |mumps|n. 腮腺炎|
+|||
+|praise|v. 赞扬<br/>n. 赞扬|
 
 + 这个web要是能设计得可以闭眼(完全不睁眼)键盘控制背单词就好了。
 + 也许可以加个AI用最近词编故事功能(返回接口中支持标注所使用单词高亮?)