原题网址: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 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.
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.
public class Solution {
public int hIndex(int[] citations) {
Arrays.sort(citations);
int h,i;
for(i=citations.length-1, h=0; i>=0 && citations[i]>h; i--, h++);
return h;
}
}
方法二:对各个引用值使用计数器,时间复杂度O(n),空间复杂度O(n)
public class Solution {
public int hIndex(int[] citations) {
int max = 0;
for(int citation: citations) if (citation > max) max = citation;
int[] counts = new int[max+1];
for(int i=0; i<citations.length; i++) counts[citations[i]] ++;
int h=0;
ALL: for(int i=max; i>=0; i--) {
for(int j=0; j<counts[i]; j++) {
if (i>h) h++; else break ALL;
}
}
return h;
}
}
也可以用TreeMap,但性能会低很多。
public class Solution {
public int hIndex(int[] citations) {
TreeMap<Integer, Integer> treemap = new TreeMap<>();
for(int c: citations) {
Integer count = treemap.get(c);
if (count == null) count = 1; else count ++;
treemap.put(c, count);
}
int h=0;
for(Integer key: treemap.descendingKeySet()) {
Integer count = treemap.get(key);
// System.out.printf("key=%d, count=%d, h=%d\n", key, count, h);
if (key <= h) break;
h += Math.min(count, key-h);
}
return h;
}
}