[LeetCode 274] H-Index

最新推荐文章于 2024-01-12 14:52:10 发布

ExcitedZhang

最新推荐文章于 2024-01-12 14:52:10 发布

阅读量117

点赞数

分类专栏： LeetCode 文章标签： LeetCode 数组

本文链接：https://blog.csdn.net/ExcitedZhang/article/details/89602984

版权

LeetCode 专栏收录该内容

118 篇文章 0 订阅

订阅专栏

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

Example:

Input:
citations = [3,0,6,1,5]
Output: 3 
Explanation: [3,0,6,1,5] 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, her h-index is 3.

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

分析

这一题简化成如下表述：求比h大的数字个数大于h的值。

那么只需要对数组进行降序排序，然后所有nums[i] >= i + 1的值都是满足题目的要求。

Code

class Solution {
public:
    static bool cmp(int& a, int& b)
    {
        return a > b;
    }
    int hIndex(vector<int>& citations) {
        int h = 0;
        sort(citations.begin(), citations.end(), cmp);
        for(int i = 0; i < citations.size(); i ++)
        {
            if (citations[i] >= i + 1)
                h = i + 1;
        }
        
        return h;
    }
};

运行效率

Runtime: 4 ms, faster than 100.00% of C++ online submissions for H-Index.

Memory Usage: 9 MB, less than 100.00% of C++ online submissions for H-Index.