题目链接:https://leetcode.com/problems/h-index/
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 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 than3
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.
思路:一个比较好想的思路就是排个序,然后从引用高到低遍历,如果引用数大于论文数,则加1.其时间复杂度为O(n log n),即快速排序的时间.
代码如下:
class Solution {
public:
int hIndex(vector<int>& citations) {
sort(citations.begin(), citations.end());
int ans = 0;
for(auto it = citations.rbegin(); it != citations.rend(); it++)
if(*it > ans) ans++;
return ans;
}
};
而另外一种用空间换时间可以将时间复杂度降为O(n).
这种做法的思路是根据这个index的范围是[0, array.size()],因此我们只需要从高到低统计引用数比当前index大的论文数量.
如果当前论文数量比index大了说明,这个index就是h-index,也就是至少有index篇论文,且引用数不低于index.此时我们就可以返回答案了.
代码如下:
class Solution {
public:
int hIndex(vector<int>& citations) {
unordered_map<int, int> hash;
int len = citations.size();
for(int i = 0; i < len; i++)
{
if(citations[i] >= len) hash[len]++;
else hash[citations[i]]++;
}
for(int i = len; i > 0; i--)
{
hash[i] += hash[i+1];
if(hash[i] >= i) return i;
}
return 0;
}
};
第二种参考:https://leetcode.com/discuss/66656/java-o-n-time-with-easy-explanation