Update h-index.js

lightningtgc · lightningtgc · commit 89f79e1d4fd7 · 2015-10-23T10:13:58.000+08:00
diff --git a/leetcode/h-index.js b/leetcode/h-index.js
@@ -3,11 +3,16 @@
 * URL: https://leetcode.com/problems/h-index/
 *
 * 题目：
-* 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.
+* 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."
 
-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.
 
-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.
+* Note: If there are several possible values for h, the maximum one is taken as the h-index.
 */
