leetcode 1157. Online Majority Element In Subarray

最新推荐文章于 2023-02-25 23:03:36 发布

景行cmy

最新推荐文章于 2023-02-25 23:03:36 发布

阅读量149

点赞数

分类专栏：线段树 leetcode 随机搜索

本文链接：https://blog.csdn.net/cmy203/article/details/101343739

版权

实现MajorityChecker类，它接收数组arr并提供一个查询方法，返回子数组中出现次数超过阈值的元素。如果不存在这样的元素，返回-1。文章介绍了两种解决方案：线段树和概率方法，并给出了相关的约束条件和示例。

摘要由CSDN通过智能技术生成

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 threshold) has arguments such that:
- 0 <= left <= right < arr.length representing a subarray of arr;
- 2 * threshold > right - left + 1, ie. the threshold is always a strict majority of the length of the subarray

Each query(...) returns the element in arr[left], arr[left+1], ..., arr[right] that occurs at least threshold times, or -1 if no such element exists.

Example:

MajorityChecker majorityChecker = new MajorityChecker([1,1,2,2,1,1]);
majorityChecker.query(0,5,4); // returns 1
majorityChecker.query(0,3,3); // returns -1
majorityChecker.query(2,3,2); // returns 2

Constraints: