LeetCode 274.H-Index

最新推荐文章于 2024-03-10 00:05:31 发布

不可不戒

最新推荐文章于 2024-03-10 00:05:31 发布

阅读量355

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/lezg_bkbj/article/details/52550788

版权

LeetCode 专栏收录该内容

23 篇文章 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.”

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.

Show Hint

public int hIndex(int[] citations) {
        if (citations == null || citations.length == 0) {
            return 0;
        }
        Arrays.sort(citations);
        int h = citations.length;
        for (int i = 0,len = h; i < len; i++) {
            if (h <= citations[i]) {
                break;
            }else {
                --h;
            }
        }
        return h;
    }