Skip to content

Commit 1e33f7a

Browse files
committed
Update h-index.js
1 parent 984d74c commit 1e33f7a

1 file changed

Lines changed: 8 additions & 0 deletions

File tree

leetcode/h-index.js

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,4 +2,12 @@
22
/**
33
* URL: https://leetcode.com/problems/h-index/
44
*
5+
* 题目:
6+
* 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.
7+
8+
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."
9+
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. 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.
11+
12+
Note: If there are several possible values for h, the maximum one is taken as the h-index.
513
*/

0 commit comments

Comments
 (0)