[LeetCode] H-Index H篇论文至少有H次引用

声明：原题目转载自LeetCode，解答部分为原创

Problem ：

        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.

Solution：

        思路：对数组按照从小到大重新排序，对倒数第N个元素，若citations[N] >= N，则至少N符合 N-Index，继续考虑N + 1的情况。重复以上操作直至citations[N] < N，此时表明N 不符合 N-Index，则可判断最大的符合 H-Index 的值为 N - 1。值得注意的是，若从未发表论文，即citations数组为空，则返回值为0。

        代码如下：

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

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

int main()
{
	vector<int> citations;
	citations.push_back(3);
	citations.push_back(0);
	citations.push_back(6);
	citations.push_back(1);
	citations.push_back(5);
	
	Solution text;
	cout << text.hIndex(citations) << endl;
	return 0;
}