-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path18jul23hIdx.ts
55 lines (41 loc) · 1.44 KB
/
18jul23hIdx.ts
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
// Given an array of integers citations where citations[i] is the number of citations a researcher received for their ith paper, return the researcher's h-index.
// According to the definition of h-index on Wikipedia: The h-index is defined as the maximum value of h such that the given researcher has published at least h papers that have each been cited at least h times.
//
// Example 1:
// Input: citations = [3,0,6,1,5]
// Output: 3
// Explanation: [3,0,6,1,5] 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, their h-index is 3.
// Example 2:
// Input: citations = [1,3,1]
// Output: 1
//
// Constraints:
// n == citations.length
// 1 <= n <= 5000
// 0 <= citations[i] <= 1000
function hIndex(citations):number {
let sortedArr:number[] = citations.sort((a, b) => b - a);
let hIdx:number = 0;
for (let i:number = 0; i < sortedArr.length; i++) {
if (sortedArr[i] >= i + 1) {
hIdx = i + 1;
} else {
break;
}
}
return hIdx;
}
var hIndex2 = function(citations) {
citations.sort((a, b) => b - a); // Sort the array in descending order
const n = citations.length;
let hIndex = 0;
for (let i = 0; i < n; i++) {
if (citations[i] >= i + 1) {
hIndex = i + 1;
} else {
break;
}
}
return hIndex;
};