<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Binary Indexed Tree on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/binary-indexed-tree/</link><description>Recent content in Binary Indexed Tree on LeetCode 题解笔记</description><generator>Hugo</generator><language>zh-cn</language><copyright>2026 ZenzZwei</copyright><lastBuildDate>Mon, 11 May 2026 12:12:02 +0800</lastBuildDate><atom:link href="https://leetcode-solutions-5zk.pages.dev/tags/binary-indexed-tree/index.xml" rel="self" type="application/rss+xml"/><item><title>2286. 分组预订音乐会门票</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2286-booking-concert-tickets-in-groups/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2286-booking-concert-tickets-in-groups/</guid><description>Hard | Binary Search, Design, Binary Indexed Tree, Segment Tree</description></item><item><title>3515. 带权树中的最短路径</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3515-shortest-path-in-a-weighted-tree/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3515-shortest-path-in-a-weighted-tree/</guid><description>Hard | Array, Tree, Depth-First Search, Binary Indexed Tree, Segment Tree</description></item><item><title>1505. 最多K次相邻交换后的最小整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1505-minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1505-minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/</guid><description>Hard | String, Greedy, Binary Indexed Tree, Segment Tree</description></item><item><title>406. 根据身高重建队列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0406-queue-reconstruction-by-height/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0406-queue-reconstruction-by-height/</guid><description>Medium | Array, Binary Indexed Tree, Segment Tree, Sorting</description></item><item><title>3245. 交替组 III</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3245-alternating-groups-iii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3245-alternating-groups-iii/</guid><description>Hard | Array, Binary Indexed Tree, Ordered Set</description></item><item><title>3380. 最大矩形面积与点约束 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3380-maximum-area-rectangle-with-point-constraints-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3380-maximum-area-rectangle-with-point-constraints-i/</guid><description>Medium | Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting, Enumeration</description></item><item><title>3382. 具有点约束的最大面积矩形 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3382-maximum-area-rectangle-with-point-constraints-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3382-maximum-area-rectangle-with-point-constraints-ii/</guid><description>Hard | Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting</description></item><item><title>3624. 具有相等popcount深度K的整数数量 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3624-number-of-integers-with-popcount-depth-equal-to-k-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3624-number-of-integers-with-popcount-depth-equal-to-k-ii/</guid><description>Hard | Array, Divide and Conquer, Binary Indexed Tree, Segment Tree</description></item><item><title>3671. 美丽子序列的和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3671-sum-of-beautiful-subsequences/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3671-sum-of-beautiful-subsequences/</guid><description>Hard | Array, Math, Binary Indexed Tree, Number Theory</description></item><item><title>3072. 将元素分配到两个数组中 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3072-distribute-elements-into-two-arrays-ii/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3072-distribute-elements-into-two-arrays-ii/</guid><description>Hard | Array, Binary Indexed Tree, Segment Tree, Simulation</description></item><item><title>3161. 区块放置查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3161-block-placement-queries/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3161-block-placement-queries/</guid><description>Hard | Array, Binary Search, Binary Indexed Tree, Segment Tree</description></item><item><title>3187. 数组中的峰值</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3187-peaks-in-array/</link><pubDate>Sun, 26 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3187-peaks-in-array/</guid><description>Hard | Array, Binary Indexed Tree, Segment Tree</description></item><item><title>2659. 数组清空</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2659-make-array-empty/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2659-make-array-empty/</guid><description>Hard | Array, Binary Search, Greedy, Binary Indexed Tree, Segment Tree, Sorting, Ordered Set</description></item><item><title>2736. 最大和查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2736-maximum-sum-queries/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2736-maximum-sum-queries/</guid><description>Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Sorting, Monotonic Stack</description></item><item><title>2916. 子数组不同元素数目的平方和 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2916-subarrays-distinct-element-sum-of-squares-ii/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2916-subarrays-distinct-element-sum-of-squares-ii/</guid><description>Hard | Array, Dynamic Programming, Binary Indexed Tree, Segment Tree</description></item><item><title>2926. 最大平衡子序列和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2926-maximum-balanced-subsequence-sum/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2926-maximum-balanced-subsequence-sum/</guid><description>Hard | Array, Binary Search, Dynamic Programming, Binary Indexed Tree, Segment Tree</description></item><item><title>2940. 找到爱丽丝和鲍勃可以相遇的建筑</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2940-find-building-where-alice-and-bob-can-meet/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2940-find-building-where-alice-and-bob-can-meet/</guid><description>Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stack</description></item><item><title>2179. 统计数组中的好三元组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2179-count-good-triplets-in-an-array/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2179-count-good-triplets-in-an-array/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>2193. 将字符串转换为回文串的最少移动次数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2193-minimum-number-of-moves-to-make-palindrome/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2193-minimum-number-of-moves-to-make-palindrome/</guid><description>Hard | Two Pointers, String, Greedy, Binary Indexed Tree</description></item><item><title>2250. 统计包含每个点的矩形数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2250-count-number-of-rectangles-containing-each-point/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2250-count-number-of-rectangles-containing-each-point/</guid><description>Medium | Array, Hash Table, Binary Search, Binary Indexed Tree, Sorting</description></item><item><title>2407. 最长递增子序列 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2407-longest-increasing-subsequence-ii/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2407-longest-increasing-subsequence-ii/</guid><description>Hard | Array, Divide and Conquer, Dynamic Programming, Binary Indexed Tree, Segment Tree, Queue, Monotonic Queue</description></item><item><title>2424. 最长上传前缀</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2424-longest-uploaded-prefix/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2424-longest-uploaded-prefix/</guid><description>Medium | Hash Table, Binary Search, Union-Find, Design, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Ordered Set</description></item><item><title>2426. 满足不等式的数对数目</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2426-number-of-pairs-satisfying-inequality/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2426-number-of-pairs-satisfying-inequality/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>2552. 递增四元组的数量</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2552-count-increasing-quadruplets/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2552-count-increasing-quadruplets/</guid><description>Hard | Array, Dynamic Programming, Binary Indexed Tree, Enumeration, Prefix Sum</description></item><item><title>1395. 统计作战单位数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1395-count-number-of-teams/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1395-count-number-of-teams/</guid><description>Medium | Array, Dynamic Programming, Binary Indexed Tree, Segment Tree</description></item><item><title>1409. 带键的排列查询</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1409-queries-on-a-permutation-with-key/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1409-queries-on-a-permutation-with-key/</guid><description>Medium | Array, Binary Indexed Tree, Simulation</description></item><item><title>1649. 通过指令创建有序数组</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1649-create-sorted-array-through-instructions/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1649-create-sorted-array-through-instructions/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>1964. 找出每个位置上最长的有效障碍赛跑路线</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1964-find-the-longest-valid-obstacle-course-at-each-position/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1964-find-the-longest-valid-obstacle-course-at-each-position/</guid><description>Hard | Array, Binary Search, Binary Indexed Tree</description></item><item><title>1157. 子数组中的在线多数元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1157-online-majority-element-in-subarray/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1157-online-majority-element-in-subarray/</guid><description>Hard | Array, Binary Search, Design, Binary Indexed Tree, Segment Tree</description></item><item><title>493. 翻转对</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0493-reverse-pairs/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0493-reverse-pairs/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>673. 最长递增子序列的个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0673-number-of-longest-increasing-subsequence/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0673-number-of-longest-increasing-subsequence/</guid><description>Medium | Array, Dynamic Programming, Binary Indexed Tree, Segment Tree</description></item><item><title>327. 区间和的个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0327-count-of-range-sum/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0327-count-of-range-sum/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item><item><title>218. 天际线问题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0218-the-skyline-problem/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0218-the-skyline-problem/</guid><description>Hard | Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Sweep Line, Sorting, Heap (Priority Queue), Ordered Set</description></item><item><title>307. 区域和检索 - 数组可修改</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0307-range-sum-query-mutable/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0307-range-sum-query-mutable/</guid><description>Medium | Array, Divide and Conquer, Design, Binary Indexed Tree, Segment Tree</description></item><item><title>315. 计算右侧小于当前元素的个数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0315-count-of-smaller-numbers-after-self/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0315-count-of-smaller-numbers-after-self/</guid><description>Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set</description></item></channel></rss>