[leetcode] H-Index (Hash Table)
2015-11-08 20:37
375 查看
题目:
分析:借助一个哈希表(辅助数组),实现时间复杂度为O(N). 构造好辅助数组后,从数组后面开始遍历,如果paper的总数>=引用数,返回该引用数即可。
Java代码如下:
Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index. According to the definition of h-index on Wikipedia: "A scientist has index h if h of his/her N papers have at least h citations each, and the other N − h papers have no more than h citations each." For example, given citations = [3, 0, 6, 1, 5], which means the researcher has 5 papers in total and each of them had received 3, 0, 6, 1, 5 citations respectively. Since the researcher has 3 papers with at least 3 citations each and the remaining two with no more than 3 citations each, his h-index is 3. Note: If there are several possible values for h, the maximum one is taken as the h-index.
分析:借助一个哈希表(辅助数组),实现时间复杂度为O(N). 构造好辅助数组后,从数组后面开始遍历,如果paper的总数>=引用数,返回该引用数即可。
Java代码如下:
public int hIndex(int[] citations) { int[] tmp = new int[citations.length + 1]; for (int i = 0; i < citations.length; i++) { if (citations[i] >= citations.length) { tmp[citations.length]++; } else { tmp[citations[i]]++; } } int sum = 0; for (int i = tmp.length - 1; i >= 0; i--) { sum += tmp[i]; if (sum >= i) { return i; } } return 0; }
相关文章推荐
- HDU 1043 Eight 八数码
- Unity3D 新动画Animator的事件添加和使用
- 二叉树及其遍历递归与非递归
- C语言位域(位段)
- Ubuntu下安装vim的问题和vim的设置
- MapKit自定义大头阵(iOS9下没有成功)
- 继承课后作业
- AOP 笔记
- buzzword
- MySQL学习笔记(8)之实体间的联系
- 致曾被选召的孩子们
- 杭电 can you solve this eduation?
- git 放弃本地修改 强制更新
- 安装PyLucene时执行make的错误代码
- 解决硬编码的上传文件的方式及配置文件传值、url传值的中文乱码
- shell scp
- Qt Class之QTableWidget
- Python输入函数:raw_input() 与 input() 的区别
- Java中的join方法个人理解
- 老陈,小石头、