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.

分析：题意为给定一个数组，有x个元素大于等于x,求x的最大值。例子[3,0,6,1,5]中有3个元素大于等于3，因此h-index=3

public class Solution {
    public int hIndex(int[] citations) {
       if(citations==null || citations.length==0) return 0;
        int res = 0;
        int len =  citations.length;
        for (int i = 1; i <= len; i++) {
            int temp = i;//某篇论文被引用次数
            int sum = 0;//论文被引用次数大于等于temp的篇数
            for (int j = 0; j < len; j++) {
                if(citations[j]>=temp) sum++;
                if(temp==sum)
                res = Math.max(res, sum);
            }
        }
        return res;
    }
}