The question is:
问题是:
Describe an algorithm that find in O(n) time if there is in an array of n numbers,a number that appears more than n/8 times.Describe an algorithm
阅读背景：
查找数组中是否有超过n/8次的数字。
来源：互联网
分享到：
