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.
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.
一开始直接sort整个数组之后从后往前遍历,AC了。但是很慢,看答案发现可以用桶排序,简直机智啊。
因为H最大不会超过citation的大小,因此桶的大小就是n。将大于n的数字都当做n看待计数,最后从后往前遍历。
class Solution {
public:
int hIndex(vector<int>& citations) {
int n = citations.size();
vector<int> bucket(n+1, 0);
for(auto num : citations){
if(num >= n) bucket[n]++;
else bucket[num]++;
}
int index = 0;
for(int i = n; i >= 0; -- i){
index += bucket[i];
if(index >= i) return i;
}
return 0;
}
};
275.
Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?
二分查找,嗯。
class Solution {
public:
int hIndex(vector<int>& citations) {
int left = 0, right = citations.size();
while(left < right){
int mid = left + (right - left) / 2;
if(citations[mid] >= citations.size() - mid) right = mid;
else left = mid + 1;
}
return citations.size() - left;
}
};