本文共 1057 字，大约阅读时间需要 3 分钟。

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 : "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.

看完题目，根本不知道说的是什么？

参考：

public class Solution274 {	public int hIndex(int[] citations) {		int[] hash = new int[citations.length+1];		for(int i=0; i
   
    citations.length){				hash[citations.length]++;			}			else{				hash[citations[i]]++;			}		}		int sum=0;		for(int k=citations.length; k>=0; k--){			sum+=hash[k];			if(sum>=k)				return k;		}		return 0;	}}
   

转载地址：https://blog.csdn.net/zxdfc/article/details/48738077 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！