
线段树
景行cmy
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
leetcode 850. Rectangle Area II
We are given a list of (axis-aligned)rectangles. Eachrectangle[i] = [x1, y1, x2, y2], where (x1, y1) are the coordinates of the bottom-left corner, and (x2, y2) are the coordinates of the top-righ...原创 2019-08-27 16:55:41 · 201 阅读 · 0 评论 -
leetcode 1157. Online Majority Element In Subarray
Implementing the class MajorityChecker, which has the following API: MajorityChecker(int[] arr) constructs an instance of MajorityChecker with the given array arr; int query(int left, int right, int...原创 2019-09-25 08:41:07 · 194 阅读 · 0 评论