update: 添加问题“3453.分割正方形I”的代码和题解 (#1324)

LetMeFly666 · web-flow · commit a8350f8e9352 · 2026-01-13T23:56:36.000+08:00
* feat: test master (#1318) * feat: test master (#1318) - sync action.yml 没忘记再修改下.md哈哈 * fix: test master (#1318) - jq read file error * fix: test master (#1318) - ... * fix: test master (#1318) - error jq * fix: lastModifiedTime (#1318) * feat * feat: modify time(#1318) * feat: modify time(#1318) * fix: modify time(#1318) - mo tmp json * fix: modify time(#1318) - tmp json path * fix: modify time(#1318) - tmp json indent+emptyLine * fix: modifiy time(#1318) * test: modify time json order (#1318) 刚刚是因为小写？ * feat: checkout faster (#1318) - checkout needed branches * feat: checkout faster (#1318) No Solutions changes, skip deploy * feat: blog gen优化 (#791) * feat: update with master(dev) (#791) a1dbc2d * docs: 大型网站架构 * cp: sync with master(dev) * 3453: init (#1322) * 3453: WA.cpp (#1322) 1000000000.00000 * 3453: AC.cpp (#1322) - AC,50.66%,77.15% * word: en (#1322) * fix: article update time (#1318) - 这告诉我们没事儿别盲目升级，能不用动就不要动 - fake commit msg * update: 添加问题“3453.分割正方形I”的代码和题解 (#1324) Signed-off-by: LetMeFly666 <Tisfy@qq.com> --------- Signed-off-by: LetMeFly666 <Tisfy@qq.com>
diff --git a/.github/workflows/deployHexo.yml b/.github/workflows/deployHexo.yml
@@ -78,23 +78,36 @@ jobs:
       - name: Fetch and checkout each branch (shallow)
         if: env.SKIP_DEPLOY != 'true'
         run: |
-          # TODO: Let's change this(only needed branch)
           # git clone git@github.com:LetMeFly666/LeetCode.git --depth=1
           # cd LeetCode
           # git rev-list --count HEAD
-          git fetch --prune --depth=1 origin +refs/heads/*:refs/remotes/origin/*
-          for branch in $(git branch -r | grep -v '\->'); do
-            local_branch="${branch#origin/}"
-            if [[ "$local_branch" =~ ^[0-9] ]] || [[ "$local_branch" == "From_GitCode_CSDN" ]]; then
-              echo "Skipping branch $local_branch"
+          branches=(
+            website
+            website_Static
+            website_modifyTime
+          )
+          # 非 website_testMaster 才需要 master
+          if [ "${GITHUB_REF}" != "refs/heads/website_testMaster" ]; then
+            branches+=(master)
+          else
+            echo "Triggered by website_testMaster, skip fetching master"
+          fi
+
+          echo "Branches to process: ${branches[*]}"
+
+          # 只 fetch 需要的分支
+          for branch in "${branches[@]}"; do
+            # 如果本地已存在，直接跳过
+            if git show-ref --quiet "refs/heads/$branch"; then
+              echo "Local branch $branch already exists, skipping fetch/checkout"
               continue
             fi
-            if ! git show-ref --quiet "refs/heads/$local_branch"; then
-              echo "Setting branch $local_branch"
-              git switch -c $local_branch origin/$local_branch
-            else
-              echo "Branch $local_branch already exists, skipping..."
-            fi
+
+            echo "Fetching branch $branch"
+            git fetch --depth=1 origin "$branch"
+
+            echo "Checking out branch $branch"
+            git switch -c "$branch" "origin/$branch"
           done
           
           if [ "${GITHUB_REF}" = "refs/heads/website_testMaster" ]; then
@@ -185,11 +198,12 @@ jobs:
           echo "Commit time: $commit_time"
 
           has_modified=false
-          while read -r status file; do
+          while IFS= read -r -d '' status && IFS= read -r -d '' file; do
             [[ "$file" == Solutions/*.md ]] || continue
 
             filename=$(basename "$file")
             has_modified=true
+            echo "($status)$filename"
 
             case "$status" in
               A|M)
@@ -206,7 +220,7 @@ jobs:
                   'del(.[$k])')
                 ;;
             esac
-          done < <(git diff --name-status HEAD~1 HEAD)
+          done < <(git diff --name-status -z HEAD~1 HEAD)
 
           if [ "$has_modified" = false ]; then
             echo "no modified Solutions/*.md files"
@@ -236,7 +250,7 @@ jobs:
             file_name=$(echo "$line" | jq -r 'keys[0]')
             file_time=$(echo "$line" | jq -r '.[keys[0]]')
             touch -d "$file_time" "Solutions/$file_name"
-            echo "set Solutions/$file_name -> $file_time"
+            # echo "set Solutions/$file_name -> $file_time"
           done < <(jq -c 'to_entries | map({(.key): .value}) | .[]' "$json_file")
       
       - name: Install hexo and init
@@ -271,8 +285,8 @@ jobs:
 
           # sub theme: 明日方舟arknights
           cp -a ../hexoWorkspace ../hexoWorkspace_arknights
-          ls -l ../hexoWorkspace/source/_posts
-          ls -l ../hexoWorkspace_arknights/source/_posts
+          # ls -l ../hexoWorkspace/source/_posts
+          # ls -l ../hexoWorkspace_arknights/source/_posts
       
       - name: Install dependencies
         if: env.SKIP_DEPLOY != 'true'
@@ -319,18 +333,16 @@ jobs:
       - name: Modify sitemap
         if: env.SKIP_DEPLOY != 'true'
         run: |
-          # TODO: Let's change this
-          # TODO: Let's change tag orders
           echo "" > ../hexoWorkspace/public/sitemap.txt  # 主站优先
           sed 's/theme\/arknights\///g' ../hexoWorkspace/public/theme/arknights/sitemap.txt >> ../hexoWorkspace/public/sitemap.txt
-          cat ../hexoWorkspace/public/theme/arknights/sitemap.txt >> ../hexoWorkspace/public/sitemap.txt
+          # cat ../hexoWorkspace/public/theme/arknights/sitemap.txt >> ../hexoWorkspace/public/sitemap.txt
           # echo "https://blog.letmefly.xyz/theme/arknights/sitemap.txt" >> ../hexoWorkspace/public/sitemap.txt
       
       - name: Push to github
         if: env.SKIP_DEPLOY != 'true'
         run: |
           git checkout website
-          ls -la
+          # ls -la
           cp -r .git ../hexoWorkspace/public
           cd ../hexoWorkspace/public
           # DECODED_MESSAGE=$(echo "$ENCODED_MESSAGE" | base64 --decode)
diff --git a/Codes/3453-separate-squares-i.cpp b/Codes/3453-separate-squares-i.cpp
@@ -0,0 +1,71 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-01-13 21:41:10
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-01-13 22:21:20
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    double half = 0;
+    vector<vector<int>> squares;
+
+    bool check(double h) {
+        double total = 0;
+        for (vector<int>& s : squares) {
+            double from = max(double(s[1]), h);
+            double to = s[1] + s[2];
+            total += max(0., (to - from) * s[2]);
+            // printf("(%llf -> %llf), total = %llf\n", from, to, total);
+        }
+
+        return total > half;
+    }
+public:
+    double separateSquares(vector<vector<int>>& squares) {
+        long long total = 0;  // !!!!!记得初始化
+        for (vector<int>& s : squares) {
+            total += ((long long) s[2]) * s[2];
+        }
+        this->squares = move(squares);
+        half = 1. * total / 2;
+
+        double l = 0, r = 1000000000;
+        for (int _ = 0; _ < 50; _++) {
+            double mid = (l + r) / 2;
+            if (check(mid)) {
+                l = mid;
+            } else {
+                r = mid;
+            }
+            // printf("l = %llf, r = %llf, mid = %llf\n", l, r, mid);
+        }
+        return l;
+    }
+};
+
+/*
+>>> 10**9 / 2**46
+1.4210854715202004e-05
+>>> 10**9 / 2**47
+7.105427357601002e-06
+*/
+
+#if defined(_WIN32) || defined(__APPLE__)
+/*
+[[0,0,1],[2,2,1]]
+
+*/
+int main() {
+    string s;
+    while (cin >> s) {
+        vector<vector<int>> a = stringToVectorVector(s);
+        Solution sol;
+        cout << sol.separateSquares(a) << endl;
+    }
+    return 0;
+}
+#endif
diff --git a/README.md b/README.md
@@ -1075,6 +1075,7 @@
 |3433.统计用户被提及情况|中等|<a href="https://leetcode.cn/problems/count-mentions-per-user/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/12/12/LeetCode%203433.%E7%BB%9F%E8%AE%A1%E7%94%A8%E6%88%B7%E8%A2%AB%E6%8F%90%E5%8F%8A%E6%83%85%E5%86%B5/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/155861707" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-mentions-per-user/solutions/3855685/letmefly-3433tong-ji-yong-hu-bei-ti-ji-q-6b8p/" target="_blank">LeetCode题解</a>|
 |3439.重新安排会议得到最多空余时间I|中等|<a href="https://leetcode.cn/problems/reschedule-meetings-for-maximum-free-time-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/07/13/LeetCode%203439.%E9%87%8D%E6%96%B0%E5%AE%89%E6%8E%92%E4%BC%9A%E8%AE%AE%E5%BE%97%E5%88%B0%E6%9C%80%E5%A4%9A%E7%A9%BA%E4%BD%99%E6%97%B6%E9%97%B4I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/149317430" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/reschedule-meetings-for-maximum-free-time-i/solutions/3722937/letmefly-3439zhong-xin-an-pai-hui-yi-de-r3t9e/" target="_blank">LeetCode题解</a>|
 |3442.奇偶频次间的最大差值I|简单|<a href="https://leetcode.cn/problems/maximum-difference-between-even-and-odd-frequency-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/06/10/LeetCode%203442.%E5%A5%87%E5%81%B6%E9%A2%91%E6%AC%A1%E9%97%B4%E7%9A%84%E6%9C%80%E5%A4%A7%E5%B7%AE%E5%80%BCI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/148570777" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-difference-between-even-and-odd-frequency-i/solutions/3697605/letmefly-3442qi-ou-pin-ci-jian-de-zui-da-nwwx/" target="_blank">LeetCode题解</a>|
+|3453.分割正方形I|中等|<a href="https://leetcode.cn/problems/separate-squares-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/01/13/LeetCode%203453.%E5%88%86%E5%89%B2%E6%AD%A3%E6%96%B9%E5%BD%A2I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/156915633" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/separate-squares-i/solutions/3880005/letmefly-3453fen-ge-zheng-fang-xing-ier-vem4p/" target="_blank">LeetCode题解</a>|
 |3459.最长V形对角线段的长度|困难|<a href="https://leetcode.cn/problems/length-of-longest-v-shaped-diagonal-segment/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/08/31/LeetCode%203459.%E6%9C%80%E9%95%BFV%E5%BD%A2%E5%AF%B9%E8%A7%92%E7%BA%BF%E6%AE%B5%E7%9A%84%E9%95%BF%E5%BA%A6/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/151050078" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/length-of-longest-v-shaped-diagonal-segment/solutions/3768545/letmefly-3459zui-chang-v-xing-dui-jiao-x-gu8q/" target="_blank">LeetCode题解</a>|
 |3461.判断操作后字符串中的数字是否相等I|简单|<a href="https://leetcode.cn/problems/check-if-digits-are-equal-in-string-after-operations-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/10/23/LeetCode%203461.%E5%88%A4%E6%96%AD%E6%93%8D%E4%BD%9C%E5%90%8E%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E6%95%B0%E5%AD%97%E6%98%AF%E5%90%A6%E7%9B%B8%E7%AD%89I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/153800840" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/check-if-digits-are-equal-in-string-after-operations-i/solutions/3814120/letmefly-3461pan-duan-cao-zuo-hou-zi-fu-8nd1t/" target="_blank">LeetCode题解</a>|
 |3494.酿造药水需要的最少总时间|中等|<a href="https://leetcode.cn/problems/find-the-minimum-amount-of-time-to-brew-potions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/10/09/LeetCode%203494.%E9%85%BF%E9%80%A0%E8%8D%AF%E6%B0%B4%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E5%B0%91%E6%80%BB%E6%97%B6%E9%97%B4/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/152847907" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-minimum-amount-of-time-to-brew-potions/solutions/3801656/letmefly-3494niang-zao-yao-shui-xu-yao-d-bjxv/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 3453.分割正方形I.md b/Solutions/LeetCode 3453.分割正方形I.md
@@ -0,0 +1,137 @@
+---
+title: 3453.分割正方形 I：二分查找
+date: 2026-01-13 23:46:15
+tags: [题解, LeetCode, 中等, 数组, 二分查找, 二分]
+categories: [题解, LeetCode]
+index_img: https://pic.leetcode.cn/1739609465-UaFzhk-4062example1drawio.png
+---
+
+# 【LetMeFly】3453.分割正方形 I：二分查找
+
+力扣题目链接：[https://leetcode.cn/problems/separate-squares-i/](https://leetcode.cn/problems/separate-squares-i/)
+
+<p>给你一个二维整数数组 <code>squares</code>&nbsp;，其中&nbsp;<code>squares[i] = [x<sub>i</sub>, y<sub>i</sub>, l<sub>i</sub>]</code> 表示一个与 x 轴平行的正方形的左下角坐标和正方形的边长。</p>
+
+<p>找到一个<strong>最小的</strong> y 坐标，它对应一条水平线，该线需要满足它以上正方形的总面积 <strong>等于</strong> 该线以下正方形的总面积。</p>
+
+<p>答案如果与实际答案的误差在 <code>10<sup>-5</sup></code> 以内，将视为正确答案。</p>
+
+<p><strong>注意</strong>：正方形&nbsp;<strong>可能会&nbsp;</strong>重叠。重叠区域应该被&nbsp;<strong>多次计数&nbsp;</strong>。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">squares = [[0,0,1],[2,2,1]]</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">1.00000</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p><img alt="" src="https://pic.leetcode.cn/1739609465-UaFzhk-4062example1drawio.png" style="width: 378px; height: 352px;" /></p>
+
+<p>任何在 <code>y = 1</code> 和 <code>y = 2</code> 之间的水平线都会有 1 平方单位的面积在其上方，1 平方单位的面积在其下方。最小的 y 坐标是 1。</p>
+</div>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">squares = [[0,0,2],[1,1,1]]</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">1.16667</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p><img alt="" src="https://pic.leetcode.cn/1739609527-TWqefZ-4062example2drawio.png" style="width: 378px; height: 352px;" /></p>
+
+<p>面积如下：</p>
+
+<ul>
+	<li>线下的面积：<code>7/6 * 2 (红色) + 1/6 (蓝色) = 15/6 = 2.5</code>。</li>
+	<li>线上的面积：<code>5/6 * 2 (红色) + 5/6 (蓝色) = 15/6 = 2.5</code>。</li>
+</ul>
+
+<p>由于线以上和线以下的面积相等，输出为 <code>7/6 = 1.16667</code>。</p>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= squares.length &lt;= 5 * 10<sup>4</sup></code></li>
+	<li><code>squares[i] = [x<sub>i</sub>, y<sub>i</sub>, l<sub>i</sub>]</code></li>
+	<li><code>squares[i].length == 3</code></li>
+	<li><code>0 &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 10<sup>9</sup></code></li>
+	<li><code>1 &lt;= l<sub>i</sub> &lt;= 10<sup>9</sup></code></li>
+	<li>所有正方形的总面积不超过 <code>10<sup>12</sup></code>。</li>
+</ul>
+
+
+    
+## 解题方法：二分查找
+
+先算下所有正方形的总面积，然后二分分割线高度，太低就高点太高就低点。
+
+终止条件：两次计算结果分割线移动返回不超过$10^{-5}$或直接进行$50$次求值。
+
+```python
+>>> 10**9 / 2**46
+1.4210854715202004e-05
+>>> 10**9 / 2**47
+7.105427357601002e-06
+```
+
++ 时间复杂度$O(C\times len(squares))$，其中$C=50$或$C=\log_2{max(squires[i][1])-min(squires[i][1])}$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @LastEditTime: 2026-01-13 22:21:20
+ */
+class Solution {
+private:
+    double half = 0;
+    vector<vector<int>> squares;
+
+    bool check(double h) {
+        double total = 0;
+        for (vector<int>& s : squares) {
+            double from = max(double(s[1]), h);
+            double to = s[1] + s[2];
+            total += max(0., (to - from) * s[2]);
+        }
+
+        return total > half;
+    }
+public:
+    double separateSquares(vector<vector<int>>& squares) {
+        long long total = 0;  // !!!!!记得初始化
+        for (vector<int>& s : squares) {
+            total += ((long long) s[2]) * s[2];
+        }
+        this->squares = move(squares);
+        half = 1. * total / 2;
+
+        double l = 0, r = 1000000000;
+        for (int _ = 0; _ < 50; _++) {
+            double mid = (l + r) / 2;
+            if (check(mid)) {
+                l = mid;
+            } else {
+                r = mid;
+            }
+        }
+        return l;
+    }
+};
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/156915633)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2026/01/13/LeetCode%203453.%E5%88%86%E5%89%B2%E6%AD%A3%E6%96%B9%E5%BD%A2I/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)
diff --git a/Solutions/Other-Accumulation-SomeTips.md b/Solutions/Other-Accumulation-SomeTips.md
@@ -1085,6 +1085,11 @@ certbot renew
 certbot renew --force-renewal
 ```
 
+### 读《大型网站技术架构——核心原理与案例分析(李智慧)》有感
+
+* 网站的价值在于它能为用户提供什么价值，在于网站能做什么，而不在于它是怎么做的。所以**在网站还很小的时候就去追求网站的架构师舍本逐末，得不偿失的** 。
+* 在业务问题还没有理清楚的时候就从外面挖来许多技术高手，仿照成功的互联网平台打造技术平台，这无疑是南辕北辙，缘木求鱼。而这些技术高手离开了他们熟悉的环境和工作模式，也是张飞拿着绣花针使不上劲来。
+
 ## About API
 
 ### bilibili API
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
@@ -1735,6 +1735,9 @@ categories: [自用]
 |tyrant|n. 暴君|
 |||
 |exoneration|n. 免罪，免除|
+|||
+|Oceania|n. 大洋洲|
+|phonetics|n. 语音学|
 
 + 这个web要是能设计得可以闭眼(完全不睁眼)键盘控制背单词就好了。
 + 也许可以加个AI用最近词编故事功能(返回接口中支持标注所使用单词高亮?)
diff --git a/has_modified.sh b/has_modified.sh
