H-Index

leetcode 274

题目描述

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.”

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.

Hint:

An easy approach is to sort the array first.

解法

1.把数组按从大到小的顺序排序
2.数的位置为i+1（i = 0,1,2,3…），该位对应的引用数为nums[i],找到**最后一个**nums[i]>=i的i的值就是所求的值

代码

class Solution {
public:
    if(citations.empty()) return 0;
        sort(citations.begin(), citations.end());
        for(int i = 0; i < citations.size(); i++)
            //找到第一个比它小的，比它前一个就是最后一个>=它的
            if(citations[i] < i + 1) return i;
        return citations.size();
};