# H-Index

231人阅读 评论(0)

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.

public int hIndex(int[] citations) {
Arrays.sort(citations);
int n=citations.length;
for(int i=n-1;i>=0;i--){
if(citations[i]<n-i)
return n-i-1;
}
return 0;
}

public class Solution {
public int hIndex(int[] citations) {
int n = citations.length;
int[] countArray = new int[n+1];

for(int i=0; i<n; i++) {
if(citations[i] >= n) countArray[n]++;
else countArray[citations[i]]++;
}
if(countArray[n]>=n) return n;

for(int i=n-1; i>=0; i--) {
countArray[i] = countArray[i] + countArray[i+1];
if(countArray[i]>=i) return i;
}
return 0;
}
}

private static void sort(int a[], int b[], int k){
//初始化计数数组
int c[] = new int[k];
for(int i = 0; i<k; i++)
c[i] = 0;
//计算数组中重复的次数
for(int i=0; i<a.length; i++)
{
c[a[i]] = c[a[i]]+1;
}
for(int i = 1; i<k; i++)
{
c[i] = c[i]+c[i-1];
}
//将a数组中的元素按照顺序复制到b中
for(int i = a.length-1; i>=0; i--)
{
b[c[a[i]]-1] = a[i];
c[a[i]] = c[a[i]]-1;
}
}  

0
0

个人资料
• 访问：63451次
• 积分：2768
• 等级：
• 排名：第15331名
• 原创：215篇
• 转载：37篇
• 译文：0篇
• 评论：6条
最新评论