leetcode： 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.

Show Hint

public class Solution {
    public int hIndex(int[] citations) {
        if(citations == null || citations.length == 0){
            return 0;
        }
        int ans = 0;
        int[] hIndex = new int[citations.length + 2];
        for(int i : citations){
            if(i > citations.length){
                hIndex[citations.length]++;
            }else{
                hIndex[i]++;
            }
        }

        //System.out.println(Arrays.toString(hIndex));
        for(int i = citations.length ; i >= 0; --i){
            hIndex[i] += hIndex[i + 1];
            if(hIndex[i] >= i){
                return i;
            }
        }
        return 0;
    }
}