274. H-Index

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

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.

Analysis:

本题的题意是在寻找一个数，使得数组中比他大的值的个数不小于它，数组中其他书不大于它。本题的思路是首先对数组进行排序，然后从大到小进行遍历，使用计数器来进行迭代找到满足题意的最大值。代码如下：

Code:

class Solution {
    public int hIndex(int[] citations) {
        if(citations.length < 1)
            return 0;
        Arrays.sort(citations);
        int res = 0;
        int cnt = 0;
        for(int i = citations.length - 1; i >= 0; i--) {
            if(citations[i] > cnt) {
                cnt++;
                if(i - 1 >= 0 && citations[i - 1] <= cnt) {
                    res = Math.max(res, cnt);    
                }
            } else {
                break;
            }
        }
        res = Math.max(res, cnt);
        return res;
    }
}