|
2 | 2 |
|
3 | 3 | importjava.util.Arrays; |
4 | 4 |
|
5 | | -/** |
6 | | - * 274. H-Index |
7 | | - * |
8 | | - * 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. |
9 | | - * 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." |
10 | | - * 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. |
11 | | - * 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. |
12 | | -
|
13 | | - Note: If there are several possible values for h, the maximum one is taken as the h-index. |
14 | | -
|
15 | | - Hint: |
16 | | - An easy approach is to sort the array first. |
17 | | - What are the possible values of h-index? |
18 | | - A faster approach is to use extra space. |
19 | | - */ |
20 | 5 | publicclass_274 { |
21 | 6 | publicstaticclassSolution1 { |
22 | 7 | publicinthIndex(int[]citations) { |
|