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 leasth citations each, and the other N − h papers have no more thanh citations each.”
Example:
1 2 3 4 5 6
Input: citations = [0,1,3,5,6] Output: 3 Explanation: [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 with at least 3 citations each and the remaining two with no more than 3 citations each, her h-index is 3.
代码实现
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
class { public: inthIndex(vector<int>& citations){
int result = 0;
while (result < citations.size()) { if (citations[citations.size()-1-result] < result+1) return result; result += 1; }
近期评论