
树状数组(BIT)
文章平均质量分 82
liuchenjane
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
307. Range Sum Query - Mutable.
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. The update(i, val) function modifies nums by updating the element at index i to val. Examp转载 2017-02-17 10:49:48 · 359 阅读 · 0 评论 -
从求逆序对和mergeSort谈起(3)
Inversion Count for an array indicates – how far (or close) the array is from being sorted. If array is already sorted then inversion count is 0. If array is sorted in reverse order that inversion coun原创 2017-02-23 09:59:57 · 485 阅读 · 0 评论