[Leetcode]H-Index
来源:互联网 发布:软件下载源码 编辑:程序博客网 时间:2024/06/04 19:59
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 otherN − h papers have no more than h citations each."
For example, given citations = [3, 0, 6, 1, 5]
, which means the researcher has5
papers in total and each of them had received 3, 0, 6, 1, 5
citations respectively. Since the researcher has3
papers with at least 3
citations each and the remaining two withno 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.
Hint:
- An easy approach is to sort the array first.
- What are the possible values of h-index?
- A faster approach is to use extra space.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
class Solution {public: /*algorithm: time O(nlogn) space O(1) */ int hIndex(vector<int>& citations) { int n = citations.size(); sort(citations.begin(),citations.end(),greater<int>()); for(int i = 0;i < n;i++){ if(i+1 > citations[i])return i; } return n; }};
class Solution {public: /*algorithm: count sort time O(n) space O(n) i+1 > citations */ int hIndex(vector<int>& citations) { int n = citations.size(); vector<int>cnt(n+1,0); for(int i = 0;i < n;i++){ cnt[min(n,citations[i])]++; } int sum = 0; for(int i = n;i >= 0;i--){ sum += cnt[i]; if(sum >= i)return i; } }};
- Leetcode 274 : H-index
- leetcode H-Index
- [leetcode][sort] H-Index
- 【leetCode】H-Index
- Leetcode: H-Index
- Leetcode: H-Index II
- leetcode 274: H-Index
- [leetcode] 274.H-Index
- leetcode 之 H-index
- LeetCode: H-Index
- leetcode H-index 2
- Leetcode: H-Index
- Leetcode: H-Index II
- leetcode: H-Index
- [LeetCode 274] H-index
- [LeetCode]H-Index
- [LeetCode]H-Index II
- H-Index -- leetcode
- 【Machine Learning】3.多元线性回归
- ListView空指针
- sort/uniq/cut/wc/
- 黑马程序员---IO流(二)
- ARM、DSP、FPGA的区别
- [Leetcode]H-Index
- 两线程交替打印数字
- JavaScript高级程序设计之DOM之DOM 操作技术之使用NodeList第10.2.4讲
- 正则表达式 匹配中文,英文字母和数字及_的写法!同时控制长度
- WPF基础入门
- Linux下查看tomcat连接数
- GCC参数详解
- 介绍几本专业的书籍,一起学习 关于技术 数学方面的
- codeforce 590d