题目: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.
解析1::先从大到小排序,然后从前往后扫描,如果当前文章数(即当前下标+1)等于值本身,则返回当前文章数作为 h-index;如果当前文章数大于值本身,则返回当前文章数-1作为H-Index, 因为当前文章的引用数小于当前文章数,不能算在内。时间复杂度O(n log n,空间复杂度O(1)。代码如下:
// 将引用数数组从大到小排序
// 时间复杂度 O(nlogn), 空间复杂度 O(1)
class Solution {
public:
int hIndex(vector<int>& citations) {
// 将引用数从大到小排序
sort(citations.begin(), citations.end(), greater<int>());
int hindex = 0;
for (int i = 0; i < citations.size(); ++i) {
if (i + 1 <= citations[i])
hindex = max(hindex, i + 1);
}
return hindex;
}
};
解析2:跟思路一类似,不过排序算法换成了计数排序。有一个小技巧,因为 HIndex 最大不可能超过论文综述,所以我们只需要开一个长度为 n+1 的数组,如果某篇论文的引用数超过了 n ,就将其当做 n。代码如下:
// 使用计数排序
// 时间复杂度 O(n),空间复杂度 O(n)
class Solution {
public:
int hIndex(vector<int>& citations) {
const int n = citations.size();
// 因为 h index 小于等于 n
vector<int> count(n + 1, 0);
// count[i] 表示引用数等于 i 的文章数
// count[n] 表示引用数大于等于 n 的文章数
int sum = 0;
for (int x : citations)
++count[x > n ? n : x];
int sum = 0;
for (int i = n; i >= 0; --i) {
sum += count[i]; // sum 表示引用数大于等于 i 的文章数
if (sum >= i)
return i;
}
}
};