update: 添加问题“761.特殊的二进制字符串”的代码和题解 (#1401)

Tisfy · web-flow · commit 7adf0fc580b9 · 2026-02-20T12:11:55.000+08:00
* 761: AC.cpp (#1400) + en cpp - AC,100.00%,6.45% * update: 添加问题“761.特殊的二进制字符串”的代码和题解 (#1401) Signed-off-by: Tisfy <Tisfy@foxmail.com> * fix: Windows cmd cd F:xx needs F: first --------- Signed-off-by: Tisfy <Tisfy@foxmail.com>
diff --git a/.commitTitleExtra b/.commitTitleExtra
diff --git a/.commitmsg b/.commitmsg
diff --git a/Codes/0761-special-binary-string.cpp b/Codes/0761-special-binary-string.cpp
@@ -0,0 +1,55 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-02-20 11:00:36
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-02-20 11:12:06
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+/*
+11011000
+(()(()))
+(  ()   (())    )
+*/
+class Solution {
+private:
+    vector<pair<int, int>> split(string& s) {
+        vector<pair<int, int>> ans;
+        int diff = 0, from = 0;
+        for (int i = 0; i < s.size(); i++) {
+            if (s[i] == '1') {
+                diff++;
+            } else {
+                diff--;
+            }
+            if (!diff) {
+                ans.push_back({from, i});
+                from = i + 1;
+            }
+        }
+        return ans;
+    }
+public:
+    string makeLargestSpecial(string s) {
+        if (s.empty()) {
+            return s;
+        }
+        vector<pair<int, int>> pairs = split(s);
+        if (pairs.size() == 1) {
+            return '1' + makeLargestSpecial(s.substr(1, s.size() - 2)) + '0';
+        }
+        vector<string> parts;
+        parts.reserve(pairs.size());
+        for (auto [l, r] : pairs) {
+            parts.push_back(makeLargestSpecial(s.substr(l, r - l + 1)));
+        }
+        sort(parts.begin(), parts.end(), greater<>());
+        string ans;
+        for (string& part : parts) {
+            ans += part;
+        }
+        return ans;
+    }
+};
diff --git a/Codes/0761-special-binary-string_dfsLess.cpp b/Codes/0761-special-binary-string_dfsLess.cpp
@@ -0,0 +1,52 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-02-20 11:19:26
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-02-20 11:21:04
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+/*
+11011000
+(()(()))
+(  ()   (())    )
+*/
+class Solution {
+private:
+    vector<pair<int, int>> split(string& s) {
+        vector<pair<int, int>> ans;
+        int diff = 0, from = 0;
+        for (int i = 0; i < s.size(); i++) {
+            if (s[i] == '1') {
+                diff++;
+            } else {
+                diff--;
+            }
+            if (!diff) {
+                ans.push_back({from, i});
+                from = i + 1;
+            }
+        }
+        return ans;
+    }
+public:
+    string makeLargestSpecial(string s) {
+        if (s.empty()) {
+            return s;
+        }
+        vector<pair<int, int>> pairs = split(s);
+        vector<string> parts;
+        parts.reserve(pairs.size());
+        for (auto [l, r] : pairs) {
+            parts.push_back('1' + makeLargestSpecial(s.substr(l + 1, r - l - 1)) + '0');
+        }
+        sort(parts.begin(), parts.end(), greater<>());
+        string ans;
+        for (string& part : parts) {
+            ans += part;
+        }
+        return ans;
+    }
+};
diff --git a/README.md b/README.md
@@ -409,6 +409,7 @@
 |0749.隔离病毒|困难|<a href="https://leetcode.cn/problems/contain-virus/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/07/18/LeetCode%200749.%E9%9A%94%E7%A6%BB%E7%97%85%E6%AF%92/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/125846470" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/contain-virus/solution/letmefly-749ge-chi-bing-du-by-tisfy-746u/" target="_blank">LeetCode题解</a>|
 |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>|
 |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>|
diff --git a/Solutions/LeetCode 0761.特殊的二进制字符串.md b/Solutions/LeetCode 0761.特殊的二进制字符串.md
@@ -0,0 +1,141 @@
+---
+title: 761.特殊的二进制字符串：分治（左右括号对移动）
+date: 2026-02-20 11:23:43
+tags: [题解, LeetCode, 困难, 字符串, 分治, 排序, 递归, DFS]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】761.特殊的二进制字符串：分治（左右括号对移动）
+
+力扣题目链接：[https://leetcode.cn/problems/special-binary-string/](https://leetcode.cn/problems/special-binary-string/)
+
+<p><strong>特殊的二进制字符串</strong> 是具有以下两个性质的二进制序列：</p>
+
+<ul>
+	<li><code>0</code> 的数量与 <code>1</code> 的数量相等。</li>
+	<li>二进制序列的每一个前缀码中 <code>1</code> 的数量要大于等于 <code>0</code> 的数量。</li>
+</ul>
+
+<p>给定一个特殊的二进制字符串&nbsp;<code>s</code>。</p>
+
+<p>一次移动操作包括选择字符串 <code>s</code> 中的两个连续的、非空的、特殊子串，并交换它们。两个字符串是连续的，如果第一个字符串的最后一个字符与第二个字符串的第一个字符的索引相差正好为 1。</p>
+
+<p>返回在字符串上应用任意次操作后可能得到的字典序最大的字符串。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre>
+<strong>输入:</strong> S = "11011000"
+<strong>输出:</strong> "11100100"
+<strong>解释:</strong>
+将子串 "10" （在 s[1] 出现） 和 "1100" （在 s[3] 出现）进行交换。
+这是在进行若干次操作后按字典序排列最大的结果。
+</pre>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<pre>
+<b>输入：</b>s = "10"
+<b>输出：</b>"10"
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= s.length &lt;= 50</code></li>
+	<li><code>s[i]</code>&nbsp;为&nbsp;<code>'0'</code> 或&nbsp;<code>'1'</code>。</li>
+	<li><code>s</code>&nbsp;是一个特殊的二进制字符串。</li>
+</ul>
+
+
+    
+## 解题方法：分治
+
+例如示例一：`11011000`，可以看成`(()(()))`。
+
+我们要做的就是保持括号处于匹配状态下，让对应的01字符串字典序尽可能大。
+
+匹配字符串有两种组合方式：
+
+1. 拼接，如`() + (()) = ()(())`；
+2. 嵌套，在`()(())`外面套一个括号变成`(()(()))`。
+
+这解法不就来了，我们可以反其道而行之，把``(()(()))`拆成`(  ()   (())    )`：
+
+> 对于最外层括号里的`()`和`(())`，当然是`(())`放到`()`前面比较好（`1100`放到`10`前面字典序更大）
+>
+> 这不就是天然的递归么，`(()(()))`只有一个“拼接的括号”，外层总体顺序不变，内层`()(())`递归：
+>
+> 内层`()(())`有两个“拼接的括号”，两个拼接的括号分别递归，直到递归字符串为空递归停止，并将两个递归完成的“拼接括号”排序重新拼接到一起，变成`(())()`。
+
++ 时间复杂度$O(n^2\log n)$，递归像树一样，每次执行有一个排序和字符串拼接
+
+    ```
+    (()(()))
+       |
+     ()(())
+     /    \
+    ''    ()
+    ```
+
++ 空间复杂度$O(n)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @LastEditTime: 2026-02-20 11:21:04
+ */
+/*
+11011000
+(()(()))
+(  ()   (())    )
+*/
+class Solution {
+private:
+    vector<pair<int, int>> split(string& s) {
+        vector<pair<int, int>> ans;
+        int diff = 0, from = 0;
+        for (int i = 0; i < s.size(); i++) {
+            if (s[i] == '1') {
+                diff++;
+            } else {
+                diff--;
+            }
+            if (!diff) {
+                ans.push_back({from, i});
+                from = i + 1;
+            }
+        }
+        return ans;
+    }
+public:
+    string makeLargestSpecial(string s) {
+        if (s.empty()) {
+            return s;
+        }
+        vector<pair<int, int>> pairs = split(s);
+        vector<string> parts;
+        parts.reserve(pairs.size());
+        for (auto [l, r] : pairs) {
+            parts.push_back('1' + makeLargestSpecial(s.substr(l + 1, r - l - 1)) + '0');
+        }
+        sort(parts.begin(), parts.end(), greater<>());
+        string ans;
+        for (string& part : parts) {
+            ans += part;
+        }
+        return ans;
+    }
+};
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/158235045)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](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/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
@@ -1823,6 +1823,8 @@ categories: [自用]
 |||
 |Brazilian|adj. 巴西的<br/>n. 巴西人|
 |infringe|v. 侵犯，违背|
+|||
+|mumps|n. 腮腺炎|
 
 + 这个web要是能设计得可以闭眼(完全不睁眼)键盘控制背单词就好了。
 + 也许可以加个AI用最近词编故事功能(返回接口中支持标注所使用单词高亮?)
diff --git a/testDaka.bash.py b/testDaka.bash.py
@@ -0,0 +1,32 @@
+'''
+Author: LetMeFly
+Date: 2026-02-19 18:57:58
+LastEditors: LetMeFly.xyz
+LastEditTime: 2026-02-20 12:04:31
+'''
+import os
+
+problem_name = 't'
+problem_url = '1'
+daka_url = '2'
+
+# os.system(f'cd tryGoPy && bash -c pwd')
+# exit()
+
+# os.system(' bash -c "cmd.exe /c \\\"echo 1\\\""  ')
+# exit()
+
+os.system(f'cd F:/OtherApps/Program/Git/Store/Store2_Web_Various/various && bash -c "source /f/FromNextcloud/sync/TFpath/let.sh && lets git tisfy" && pushhere hi 1 && bash -c "source /f/FromNextcloud/sync/TFpath/let.sh && lets git hub"')
+
+"""
+Windows上bash如何执行一行命令
+
+
+os.system(f"bash -c \"source /f/FromNextcloud/sync/TFpath/let.sh && cd /f/OtherApps/Program/Git/Store/Store2_Web_Various/various && lets git tisfy && lets git hub\"")
+现在我需要在lets git tisfy && lets git hub中间加上个环境变量中的pushhere.bat的调用 pushhere hi ni
+
+
+
+
+f'bash -c "source /f/FromNextcloud/sync/TFpath/let.sh && cd /f/OtherApps/Program/Git/Store/Store2_Web_Various/various && lets git tisfy && cmd.exe /c \\"%pushhere% \'{problem_name}[{problem_url}] 打卡链接：{daka_url}\'\\" && lets git hub"'
+"""
diff --git a/testModifyHeader.py b/testModifyHeader.py
