H-Index问题及解法
来源:互联网 发布:交通组织优化设计 编辑:程序博客网 时间:2024/06/07 20:35
问题描述:
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.
问题分析:
H-index表示你被引用的文章次数至少为n的文章至少有n篇,利用bucket方法可以求解答案。
我们知道H-index最终不会超过n(数组的长度),所以引用次数大于n的就统计到buckets[n]中即可。
过程详见代码:
class Solution {public: int hIndex(vector<int>& citations) { int n = citations.size();vector<int> buckets(n + 1,0);for (int c : citations) {if (c >= n) {buckets[n]++;}else {buckets[c]++;}}int count = 0;for (int i = n; i >= 0; i--) {count += buckets[i];if (count >= i) {return i;}}return 0; }};
- H-Index问题及解法
- H-Index II问题及解法
- Random Pick Index问题及解法
- Find Pivot Index问题及解法
- Minimum Index Sum of Two Lists问题及解法
- Heaters问题及解法
- Permutations问题及解法
- Combinations问题及解法
- Subsets问题及解法
- Triangle问题及解法
- Minesweeper问题及解法
- Two Sum问题及解法
- Reverse Integer问题及解法
- Palindrome Number问题及解法
- 3Sum问题及解法
- 4Sum问题及解法
- Valid Parentheses问题及解法
- Generate Parentheses问题及解法
- CentOS7上Python3环境搭建
- fastdfs
- HBuilder常用快捷键
- Python学习笔记:import与常用内置库
- removeFromList1;
- H-Index问题及解法
- jQuery使用ajaxSubmit()提交表单示例==引入jquery.form.js插件(专门提交表单)
- 机器学习:对决策树剪枝
- 机器学习储备(10):numpy之RandomState() 和 axis
- 机器学习:谈谈决策树
- 机器学习:说说L1和L2正则化
- 机器学习线性回归:谈谈多重共线性问题及相关算法
- python NameError: name ' book ' is not defined
- C++基础常识快速掌握--自学笔记(一)