LeetCode--No.274--H-Index

最新推荐文章于 2024-12-06 11:02:25 发布

原创最新推荐文章于 2024-12-06 11:02:25 发布 · 250 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode--Medium 专栏收录该内容

24 篇文章

订阅专栏

本文介绍了一种计算研究人员h指数的方法。h指数是一种衡量科学家影响力的方式，如果一位科学家有h篇论文至少被引用了h次，则他的h指数为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.

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

哎，接受率低于50%以下的。。第一次提交就很难过，悲哀呀悲哀

认真读题是剁么地重要哇！！！！

at least 3, no more than 3。。。都是陷阱哇陷阱哇陷阱。

public class Solution {
    public int hIndex(int[] citations) {
        if (citations == null)
            return 0;
        for(int i = citations.length; i>=1; i--){
            int count = 0;
            int count2 = 0;
            int count3 = 0;
            for(int j = 0; j < citations.length; j++){
                if (citations[j] > i)
                    count++;
                else if(citations[j] == i)
                    count2++;
                else
                    count3++;
            }
            if ((count+count2) >= i && (count2 + count3) >= (citations.length -i))
                return i;
        }
        return 0;
    }
}