[LeetCode]H-Index_k - citations csdn-优快云博客

本文链接：https://blog.youkuaiyun.com/zxdfc/article/details/48738077

本文介绍了一种计算研究人员h指数的方法。h指数是一种衡量科学家影响力的指标，若一名科学家有h篇论文至少被引用了h次，则他的h指数为h。文章提供了一个示例并给出了实现该算法的具体代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

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

参考：http://m.blog.youkuaiyun.com/blog/RIVIERA613/48251161

public class Solution274 {

	public int hIndex(int[] citations) {

		int[] hash = new int[citations.length+1];
		for(int i=0; i<citations.length; i++){
			
			if(citations[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;
	}
}