#Leetcode# 274. H-Index

https://leetcode.com/problems/h-index/

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

代码：

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

　　什么时候才能把情况想的全一点呢 但是好像逐渐沉迷怼着数据 debug 怎么肥四 上瘾？

要么就做一个一眼能看出 bug 的人吧 FH 下次你想的慢的时候让我教你吧 哈哈哈

标签：Index,return,index,researcher,int,citations,274,each,Leetcode
来源： https://www.cnblogs.com/zlrrrr/p/10711437.html