FilesExpand file tree

 master

/

_274H_Index.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

33 lines (33 loc) · 1.34 KB

 master

/

_274H_Index.java

Copy path

Top

File metadata and controls

• Code
• Blame

33 lines (33 loc) · 1.34 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

/**

* 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 class _274H_Index {

public int hIndex(int[] citations) {

if (citations == null || citations.length == 0) {

return 0;

}

int n = citations.length;

int[] cnts = new int[n + 1];

for (int citation : citations) {

if (citation >= n) {

cnts[n]++;

} else {

cnts[citation]++;

}

}

int count = 0;

for (int i = n; i >= 0; i--) {

count += cnts[i];

if (count >= i) {

return i;

}

}

return 0;

}

}