Tony's Log

Algorithms, Distributed System, Machine Learning
  博客园 :: 首页 :: 新随笔 :: 联系 :: 订阅 :: 管理 ::

2016年5月3日

LeetCode "Top K Frequent Elements"
摘要： A typical solution is heap based - "top K". Complexity is O(nlgk). There is a O(n) one indeed - bucketing the frequencies.https://leetcode.com/discuss 阅读全文
posted @ 2016-05-03 09:19 Tonix 阅读(187) 评论(0) 推荐(0)