[LeetCode] H-Index

最新推荐文章于 2019-10-02 17:23:38 发布

泉山绿树

最新推荐文章于 2019-10-02 17:23:38 发布

阅读量315

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/u011327334/article/details/49778787

版权

算法专栏收录该内容

55 篇文章 0 订阅

订阅专栏

H-Index
Total Accepted: 15872 Total Submissions: 60068 Difficulty: Medium

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.

Hint:

An easy approach is to sort the array first.
What are the possible values of h-index?
A faster approach is to use extra space.

大致意思就是有个科学家发了n篇论文，ｎ篇中有ｈ篇被引用的次数大于等于ｈ，求这个最大的ｈ

class Solution {
public:
    int hIndex(vector<int>& citations) {
        int n = citations.size();
        sort(citations.begin(),citations.end());
        int res = 0;
        for(int i = n - 1;i >= 0;--i){
            if((n - i) <= citations[i] ){
                res = max(res,n - i);
            } 
        }
        return res;
    }
};