TopKElements和Hashmap的空间复杂度问题
hashmap的空间复杂度,比如,we need to find the top frequency word in an array,so we need to use hashmap then the space complexity is O(n).
if we use brute force method,firstly,sort the array,it cost O(nlgn) ti
原创
2016-03-09 12:19:53 ·
2532 阅读 ·
0 评论