H-Index

最新推荐文章于 2024-05-19 09:55:17 发布

原创最新推荐文章于 2024-05-19 09:55:17 发布 · 592 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #c++ #算法

LeetCode 同时被 2 个专栏收录

62 篇文章

订阅专栏

C/C++

60 篇文章

订阅专栏

本文详细介绍了如何使用C++语言通过快速排序算法计算研究者的h指数，解释了h指数的定义，并提供了实现代码。通过实例演示了如何解决相关问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

原题如下：
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.

解题：
其实就是求解影响因子的题，先用快排排序的话就很好解决了。C++可以AC的代码如下：

    int hIndex(vector<int>& citations) {
        int size = citations.size();
        if(size < 1) return 0;

        sort(citations.begin(), citations.end());
        int maxIndex = 0;
        for(int i=0; i<size; i++){
            if(citations[i] >= (size -i)){
                maxIndex = size -i;
                return maxIndex;
            }
        }
        return maxIndex;
    }