题目:
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.
两种做法,逆排序和数组哈希表。
C++版:
class Solution {
public:
int hIndex(vector<int>& citations) {
if(citations.size() == 0)
return 0;
sort(citations.rbegin(), citations.rend());
for(int i = 0; i < citations.size(); i++) {
if(citations[i] <= i)
return i;
}
return (int)citations.size();
}
};
Java版:
public class Solution {
public int hIndex(int[] citations) {
if(citations.length == 0)
return 0;
int[] count = new int[citations.length + 1];
for(int i = 0; i < citations.length; i++) {
if(citations[i] > citations.length)
count[citations.length]++;
else
count[citations[i]]++;
}
int sum = 0;
for(int i = citations.length; i > 0; i--) {
if(sum + count[i] >= i)
return i;
sum += count[i];
}
return 0;
}
}
Python版:
class Solution(object):
def hIndex(self, citations):
"""
:type citations: List[int]
:rtype: int
"""
if len(citations) == 0:
return 0
citations.sort(reverse = True)
i = 0
while i <= len(citations):
if i == 0:
if citations[i] == 0:
return 0
else:
i += 1
elif i > 0:
if citations[i-1] < i:
i -= 1
break
else:
i += 1
return min(i, len(citations))