[leetcode] 274.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 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.
题意：
求出文章索引的H-index值。对于h-index，意思是某个学者有n篇文章，找出最大的h，使得该作者有h篇文章，并且这h篇文章的引用次数大于等于h。
思路：
对于给定的而一个数组，可以先进行排序。逐渐找出引用最多的文章加入到集合中，每次加入一个元素集合就增大一个，也就是h增加一。当加入一个新的元素是，这个元素的引用次数小于h+1时就返回此时的h，否则，将h加1。
以上。
代码如下:

class Solution {public:    int hIndex(vector<int>& citations) {        sort(citations.begin(), citations.end());        int h = 0;        auto iter = citations.rbegin();        while(iter != citations.rend()) {            h++;            if(*iter < h)return h - 1;            iter++;        }        return h;    }};