a*******y
发帖数: 1040 | 1 Given an array of integer as an input. write a function to return the second
most occurring element in the array
除了hash和sort | f*******t
发帖数: 7549 | | a*******y
发帖数: 1040 | | d*******u
发帖数: 186 | 4 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
| d*******u
发帖数: 186 | 5 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
| I*****8
发帖数: 37 | 6 是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
|
|
