update: 添加问题“1404.将二进制表示减到1的步骤数”的代码和题解 (#1415)

* 1404: HALF.cpp + TLE.py

* 1404: WA.py (#1413)

* 1404: AC.py (#1413) - AC,100.00%,31.67%

archive

* docs: en + git(4 days ago)

* 1404: WA.cpp (#1413)

* 1404: AC.cpp (#1413) - AC,5.11%,5.96% - 高精度模拟

* update: 添加问题“1404.将二进制表示减到1的步骤数”的代码和题解 (#1415)

Signed-off-by: Tisfy <Tisfy@foxmail.com>

* fix

---------

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

Author: Tisfy

.commitmsg

@@ -2,7 +2,7 @@
  * @Author: LetMeFly
  * @Date: 2026-02-25 21:36:09
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2026-02-25 21:37:54
+ * @LastEditTime: 2026-02-26 22:05:15
  */
 #if defined(_WIN32) || defined(__APPLE__)
 #include "_[1,2]toVector.h"
@@ -11,7 +11,7 @@
 class Solution {
 public:
     vector<int> sortByBits(vector<int>& arr) {
-        sort(arr.begin(), arr.end(), [](int& a, int& b) {
+        sort(arr.begin(), arr.end(), [](const int& a, const int& b) {
             int ca = __builtin_popcount(a);
             int cb = __builtin_popcount(b);
             return ca != cb ? ca < cb : a < b;

Codes/1356-sort-integers-by-the-number-of-1-bits_20260225.cpp

@@ -0,0 +1,136 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-02-26 22:06:13
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-02-27 22:29:56
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+/*
+1101
+1110
+111
+1000
+100
+10
+1
+*/
+
+class LetsNum {
+private:
+    // 低位->高位
+    deque<char> num;
+public:
+    // From binary string
+    LetsNum(string& s) {
+        for (char c : s) {
+            *this <<= 1;
+            *this += c;
+        }
+    }
+
+    LetsNum& operator++(int) {
+        int carry = 1;
+        for (deque<char>::iterator it = num.begin(); it != num.end(); it++) {
+            carry += *it - '0';
+            *it = carry % 10 + '0';
+            carry /= 10;
+        }
+        if (carry) {
+            num.push_back(carry + '0');
+        }
+        return *this;
+    }
+
+    // only 0/1 supported
+    LetsNum& operator+=(const int& n) {
+        if (!n) {
+            return *this;
+        }
+        (*this)++;
+        return *this;
+    }
+
+    // only 0/1 supported
+    LetsNum& operator+=(const char& c) {
+        *this += c - '0';
+        return *this;
+    }
+
+    // only <<1 supported
+    LetsNum& operator<<=(const int&) {
+        int carry = 0;
+        for (deque<char>::iterator it = num.begin(); it != num.end(); it++) {
+            carry += (*it - '0') * 2;
+            *it = carry % 10 + '0';
+            carry /= 10;
+        }
+        if (carry) {
+            num.push_back(carry + '0');
+        }
+        return *this;
+    }
+
+    // only >>1 supported
+    LetsNum& operator>>=(const int&) {
+        int mod = 0;
+        for (deque<char>::reverse_iterator it = num.rbegin(); it != num.rend(); it++) {
+            mod = mod * 10 + (*it - '0');
+            *it = mod / 2 + '0';
+            mod %= 2;
+        }
+        if (*num.rbegin() == '0') {
+            num.pop_back();
+        }
+        return *this;
+    }
+
+    // only 1 supported
+    bool operator!=(const int&) {
+        return num.size() != 1 || *num.begin() != '1';
+    }
+
+    bool isOdd() {
+        return (*num.begin() - '0') % 2;
+    }
+
+    void print() {
+        for (deque<char>::reverse_iterator it = num.rbegin(); it != num.rend(); it++) {
+            putchar(*it);
+        }
+        puts("");
+    }
+};
+
+class Solution {
+public:
+    int numSteps(string s) {
+        LetsNum num(s);
+        int ans = 0;
+        while (num != 1) {
+            if (num.isOdd()) {
+                num += 1;
+            } else {
+                num >>= 1;
+            }
+            ans++;
+        }
+        return ans;
+    }
+};
+
+#if defined(_WIN32) || defined(__APPLE__)
+/*
+1101
+*/
+int main() {
+    string s;
+    while (cin >> s) {
+        Solution sol;
+        cout << sol.numSteps(s) << endl;
+    }
+    return 0;
+}
+#endif

Codes/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.cpp

@@ -0,0 +1,29 @@
+'''
+Author: LetMeFly
+Date: 2026-02-26 23:55:52
+LastEditors: LetMeFly.xyz
+LastEditTime: 2026-02-26 23:59:25
+'''
+"""
+1101
+1110
+111
+1000
+100
+10
+1
+"""
+class Solution:
+    def numSteps(self, s: str) -> int:
+        a = int(s, 2)
+        ans = 0
+        while a != 1:
+            if a % 2:
+                a += 1
+            else:
+                a //= 2
+            ans += 1
+            # print(a)
+        return ans
+
+# print(Solution.numSteps('', '1101'))

Codes/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.py

@@ -577,6 +577,7 @@
 |1399.统计最大组的数目|简单|<a href="https://leetcode.cn/problems/count-largest-group/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/23/LeetCode%201399.%E7%BB%9F%E8%AE%A1%E6%9C%80%E5%A4%A7%E7%BB%84%E7%9A%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147448113" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-largest-group/solutions/3659689/letmefly-1399tong-ji-zui-da-zu-de-shu-mu-09kx/" target="_blank">LeetCode题解</a>|
 |1402.做菜顺序|困难|<a href="https://leetcode.cn/problems/reducing-dishes/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/10/22/LeetCode%201402.%E5%81%9A%E8%8F%9C%E9%A1%BA%E5%BA%8F/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/133974648" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/reducing-dishes/solutions/2493595/letmefly-1402zuo-cai-shun-xu-pai-xu-er-f-s5te/" target="_blank">LeetCode题解</a>|
 |1403.非递增顺序的最小子序列|简单|<a href="https://leetcode.cn/problems/minimum-subsequence-in-non-increasing-order/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/04/LeetCode%201403.%E9%9D%9E%E9%80%92%E5%A2%9E%E9%A1%BA%E5%BA%8F%E7%9A%84%E6%9C%80%E5%B0%8F%E5%AD%90%E5%BA%8F%E5%88%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126155397" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-subsequence-in-non-increasing-order/solution/letmefly-1403fei-di-zeng-shun-xu-de-zui-h56ht/" target="_blank">LeetCode题解</a>|
+|1404.将二进制表示减到1的步骤数|中等|<a href="https://leetcode.cn/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/02/27/LeetCode%201404.%E5%B0%86%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA%E5%87%8F%E5%88%B01%E7%9A%84%E6%AD%A5%E9%AA%A4%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/158472038" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/solutions/3909907/letmefly-1404jiang-er-jin-zhi-biao-shi-j-ubn7/" target="_blank">LeetCode题解</a>|
 |1408.数组中的字符串匹配|简单|<a href="https://leetcode.cn/problems/string-matching-in-an-array/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/06/LeetCode%201408.%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%8C%B9%E9%85%8D/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126189255" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/string-matching-in-an-array/solution/letmefly-1408shu-zu-zhong-de-zi-fu-chuan-v90u/" target="_blank">LeetCode题解</a>|
 |1410.HTML实体解析器|中等|<a href="https://leetcode.cn/problems/html-entity-parser/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/11/23/LeetCode%201410.HTML%E5%AE%9E%E4%BD%93%E8%A7%A3%E6%9E%90%E5%99%A8/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/134571778" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/html-entity-parser/solutions/2538393/letmefly-1410html-shi-ti-jie-xi-qi-zi-fu-psbk/" target="_blank">LeetCode题解</a>|
 |1411.给Nx3网格图涂色的方案数|困难|<a href="https://leetcode.cn/problems/number-of-ways-to-paint-n-3-grid" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/01/03/LeetCode%201411.%E7%BB%99Nx3%E7%BD%91%E6%A0%BC%E5%9B%BE%E6%B6%82%E8%89%B2%E7%9A%84%E6%96%B9%E6%A1%88%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/156545186" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/n-repeated-element-in-size-2n-array/solutions/3872035/letmefly-1411gei-n-x-3-wang-ge-tu-tu-se-gbpc3/" target="_blank">LeetCode题解</a>|

README.md

@@ -82,7 +82,7 @@ categories: [题解, LeetCode]
 class Solution {
 public:
     vector<int> sortByBits(vector<int>& arr) {
-        sort(arr.begin(), arr.end(), [](int& a, int& b) {
+        sort(arr.begin(), arr.end(), [](const int& a, const int& b) {
             int ca = __builtin_popcount(a);
             int cb = __builtin_popcount(b);
             return ca != cb ? ca < cb : a < b;