leetcode 347. Top K Frequent Elements
来源:互联网 发布:贵阳大数据就是吹牛 编辑:程序博客网 时间:2024/06/07 11:26
Given a non-empty array of integers, return the k most frequent elements.
For example,
Given [1,1,1,2,2,3]
and k = 2, return [1,2]
.
def topKFrequent(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: List[int]
"""
dic={}
for i in nums:
if i in dic:
dic[i]+=1
else:
dic[i]=1
dic = sorted(dic.iteritems(), key=lambda d: d[1], reverse=True)
result=[]
for i in range(0,k):
a,b=dic[i]
result.append(a)
return result
0 0
- LeetCode #347. Top K Frequent Elements
- [leetcode] 347. Top K Frequent Elements
- LeetCode 347. Top K Frequent Elements
- <LeetCode OJ> 347. Top K Frequent Elements
- LeetCode 347. Top K Frequent Elements
- Leetcode 347. Top K Frequent Elements
- LeetCode Everyday: 347. Top K Frequent Elements
- 【leetcode】347. Top K Frequent Elements
- leetcode 347.Top K Frequent Elements
- leetcode 347. Top K Frequent Elements
- leetcode 347. Top K Frequent Elements
- [leetcode]347. Top K Frequent Elements
- LeetCode-347.Top K Frequent Elements
- Leetcode 347.Top K Frequent Elements
- Leetcode 347. Top K Frequent Elements
- 【LeetCode】347. Top K Frequent Elements
- [leetcode] 347. Top K Frequent Elements
- leetcode-java-347. Top K Frequent Elements
- 抽象数据类型之表(List)
- Remove Linked List Elements ---LeetCode
- 【TextView】自定义TextView中文换行排版问题修复
- OSG初始测试
- PAT(乙)-1001.害死人不偿命的(3n+1)猜想 (15)
- leetcode 347. Top K Frequent Elements
- 产品经理工具
- Cassandra学习笔记 --- 关于Cassandra的节点通讯机制——Gossip
- 斯坦福大学已经训练好的词向量模型下载网址
- maven项目在eclipse中debug时看不到源码的解决方案
- Android Studio如何是用快捷键快速生成get,set,tostring,构造函数
- 用C语言模拟实现一个通讯录,要求实现其添加、删除、修改、查找、显示和排序联系人信息的功能
- nginx+tomcat 架构 HttpServletRequest.getScheme()获取正确的协议
- 解决百度Ueditor编辑器表格不显示边框问题