j*******r 发帖数: 201 | 1 一家hot startup,coding question:
Write a function that takes two parameters: (1) a String representing a text
document and (2) an integer providing the number of items to return.
Implement the function such that it returns a list of Strings ordered by
word frequency, the most frequently occurring word first. Use your best
judgement to decide how words are separated. Your solution should run in O(n
) time where n is the number of characters in the document. Implement this
function as you would for a production/commercial system. You may use any
standard data structures.
有什么好的解法吗? |
k*****o 发帖数: 43 | 2 不能hashmap统计词频后 用MinPQ 滤掉其他的么 |
j*******r 发帖数: 201 | 3 我就是这样做的,但是被告知不满意。 是否有更好的解法?
【在 k*****o 的大作中提到】![](/moin_static193/solenoid/img/up.png) : 不能hashmap统计词频后 用MinPQ 滤掉其他的么
|
s**x 发帖数: 7506 | 4
Hashmap 统计之后就成了单纯的排序问题了,我想可以用selection algorithm for
top k.
【在 j*******r 的大作中提到】![](/moin_static193/solenoid/img/up.png) : 我就是这样做的,但是被告知不满意。 是否有更好的解法?
|