All contents and pictures on this website come from the Internet and are updated regularly every week. They are for personal study and research only, and should not be used for commercial purposes. Thank you for your cooperation.

Given an array of citations **sorted in ascending order **(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:**

Input:`citations = [0,1,3,5,6]`

Output:3Explanation:`[0,1,3,5,6]`

means the researcher has`5`

papers in total and each of them had received 0`, 1, 3, 5, 6`

citations respectively. Since the researcher has`3`

papers withat least`3`

citations each and the remaining two withno more than`3`

citations each, her h-index is`3`

.

**Note:**

If there are several possible values for *h*, the maximum one is taken as the
h-index.

**Follow up:**

- This is a follow up problem to H-Index, where
`citations`

is now guaranteed to be sorted in ascending order. - Could you solve it in logarithmic time complexity?

All contents and pictures on this website come from the Internet and are updated regularly every week. They are for personal study and research only, and should not be used for commercial purposes. Thank you for your cooperation.