标签：
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.
代码如下：
1 public class Solution { 2 public int hIndex(int[] citations) { 3 if(citations.length==0) 4 return 0; 5 6 Arrays.sort(citations); 7 if(citations[citations.length-1]==0) 8 return 0; 9 if(citations[0]>=citations.length) 10 return citations.length; 11 int length=0; 12 for(int i=0;i<citations.length;i++) 13 { 14 length=citations.length-i; 15 if(citations[i]>=length) 16 { 17 int count=0; 18 if(citations[i]>=length) 19 { 20 for(int j=0;j<i;j++) 21 { 22 if(citations[j]>=length) 23 count++; 24 } 25 if(count<=length) 26 return length; 27 } 28 } 29 } 30 return length; 31 } 32 }
标签：
原文地址：http://www.cnblogs.com/ghuosaao/p/5442041.html
