Segment-Tree onhttps://h30306.github.io/blog/zh-tw/tags/segment-tree/Recent content in Segment-Tree onHugo -- gohugo.iozh-twhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungWed, 21 Oct 2026 00:00:00 +0000Segment Tree 與 Fenwick Treehttps://h30306.github.io/blog/zh-tw/algorithm/segment-tree/Wed, 21 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/algorithm/segment-tree/單點更新、區間查詢：Fenwick Tree（樹狀陣列）用 i & -i 跳，線段樹用遞迴把區間切兩半；兩者都是每次操作 O(log n)LeetCode 307: Range Sum Query - Mutablehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-307/Fri, 19 Jun 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-307/LeetCode 307 解題筆記：單點更新加區間和，前綴和每次更新要 O(n)；用線段樹或 Fenwick Tree，兩種操作都是 O(log n)LeetCode 3719: Longest Balanced Subarray Ihttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-3719/Tue, 10 Feb 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3719/LeetCode 3719 解題筆記：n 只有 1500，固定左端點往右擴，用兩個集合增量維護不同的奇數和偶數