forked from ecmadao/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNo274.h-index.js
More file actions
35 lines (34 loc) · 1.13 KB
/
No274.h-index.js
File metadata and controls
35 lines (34 loc) · 1.13 KB
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
34
35
/**
* Difficulty:
* Medium
*
* Desc:
* 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."
*
* 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.
*/
/**
* @param {number[]} citations
* @return {number}
*/
var hIndex = function(citations) {
citations.sort((pre, next) => pre - next);
for (let i = 0; i < citations.length; i += 1) {
const largerCount = citations.length - i;
const num = citations[i];
if (largerCount <= num) return largerCount;
}
return 0;
};