if the integers are in a certain range, we can use counting table, then find the second minimum. otherwise hashtable to store the frequency, then find the second max.
second
【在 a*******y 的大作中提到】 : Given an array of integer as an input. write a function to return the second : most occurring element in the array : 除了hash和sort
if the integers are in a certain range, we can use counting table, then find the second minimum. otherwise hashtable to store the frequency, then find the second max.
second
【在 a*******y 的大作中提到】 : Given an array of integer as an input. write a function to return the second : most occurring element in the array : 除了hash和sort
c*y
12 楼
但是term上不是说药店过了6500后是5%吗?而且我看AMEX官网上对药店的分类里有CVS啊
【在 t***u 的大作中提到】 : 1%,那肯定是药店。不是的话,是0.5%
I*8
13 楼
是find second maximum ? 这种思路应该是什么计数排序的一步把,也算一类sorting 把,不用sort, 和 hash?还带这样的?
find
【在 d*******u 的大作中提到】 : if the integers are in a certain range, we can use counting table, then find : the second minimum. otherwise hashtable to store the frequency, then find : the second max. : : second