Problem
An array is said to have a majority element if more than half of its entries are the same.
Given: A positive integer , a positive integer , and arrays of size containing positive integers not exceeding .
Return: For each array, output an element of this array occurring strictly more than times if such element exists, and "-1" otherwise.
Source: Algorithms by Dasgupta, Papadimitriou, Vazirani. McGraw-Hill. 2006.
数组 如果一半以上的条目相同,则表示具有多数元素。
给定:正整数,一个正整数 和 大小数组 包含不超过正整数 。
返回值:对于每个数组,输出此数组中元素的出现次数严格超过 如果该元素存在,则返回“ 1”,否则返回“ -1”。
资料来源:Dasgupta,Papadimitriou,Vazirani的算法。麦格劳-希尔。2006年
Sample Dataset
4 8 5 5 5 5 5 5 5 5 8 7 7 7 1 7 3 7 7 1 6 5 10 100 1000 1 5 1 6 7 1 1 10 1
Sample Output
5 7 -1 -1