274. 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.
题目的意思是:给定一个整型数组citations,在数组中找到一个n,使数组中有n个数的值>=n,返回n.
注意:如果有存在几个这样的n,则返回最大的值.
int len = citations.length;
int[] count = new int[len + 1];
//count[i]初始化为0,当数组中的元素值比len大时,更新count[len]的值,否则,更新count[c]的值
for (int c: citations)
if (c > len)
count[len]++;
else
count[c]++;
int total = 0;
for (int i = len; i >= 0; i--) {
total += count[i];
if (total >= i)
return i;
}
return 0;
(PS:先记录下来,并不是自己的思路)