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: 3 Explanation:[0,1,3,5,6]
means the researcher has5
papers in total and each of them had received 0, 1, 3, 5, 6
citations respectively. Since the researcher has3
papers with at least3
citations each and the remaining two with no more than3
citations each, her h-index is3
.
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?
思路:
我们使用二分查找的方式查找答案,注意跳转条件:
class Solution {
public:
int hIndex(vector<int>& citations) {
int left = 0, right = citations.size();
int mid = (left + right) / 2;
int n = citations.size();
while (left < right) {
if (citations[mid] >= n - mid) right = mid;
else left = mid + 1;
mid = (left + right) / 2;
}
return n - mid;
}
};