https://algorithm.liangqin.ren/tags/binary-indexed-tree/Recent content in Binary Indexed Tree on Algorithm SolutionsHugo -- gohugo.ioMon, 07 Sep 2026 20:40:32 -0500https://algorithm.liangqin.ren/leetcode/406/Mon, 07 Sep 2026 20:40:32 -0500https://algorithm.liangqin.ren/leetcode/406/1. Description You are given an array of people, people, which are the attributes of some people in a queue (not necessarily in order). Each people[i] = [h$_i$, k$_i$] represents the i$^{th}$ person of height hi with exactly k$_i$ other people in front who have a height greater than or equal to h$_i$. Reconstruct and return the queue that is represented by the input array people. The returned queue should be formatted as an array queue, where queue[j] = [h$_j$, k$_j$] is the attributes of the j$^{th}$ person in the queue (queue[0] is the person at the front of the queue).