Week9 H-IN

题目

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 hcitations 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 3citations 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.

分析

题目意思是计算一个科学家的H指数，一名科学家的h指数是指其发表的N篇论文中有h篇每篇至少被引h次、而其余N-h篇论文每篇被引均小于或等于h次，题目给出一个数组，数组元素代表这个科学家每篇论文被引的次数，要求求出这个科学家的h值。如果有多个h值，则取最大值。

则我们可以首先将数组进行倒序排序(这里直接使用algorithm的sort函数，然后自己定义一个cmp比较函数以让数组进行倒数排序)， 接着使用递推式求出h值：h-index (fi) = max( h-index (fi-1),min(f(i), i + 1) )

代码

int cmp1(int a,int b)
{
    return a>b;
}
class Solution {
public:
    int hIndex(vector<int>& citations) {
        sort(citations.begin(), citations.end(), cmp1);
        int result = 0;
        for (int i = 0; i < citations.size(); ++i) {
            result = max(result, min(i + 1, citations[i]));
        }
        return result;
    }
};