274,275. H-Index I, II

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.

//O(N):充分利用数组的下标信息优化程序,bucket sort
    public int hIndex(int[] citations) {
        if(citations==null || citations.length==0) return 0;
        int N = citations.length;
        int[] nums = new int[N+1];
        //h不会比N大, nums[N]引用率大于等于N的文章数，ith bucket put number of articles with citation i
        for(int i=0; i<N; i++){
            if(citations[i]>=N) nums[N]++;
            else nums[citations[i]]++;
        }
        int sum = 0;//从大引用率文章数开始搜寻
        for(int i=N;i>=0 ;i--){
            //sum是引用率大于等于i的文章数，应该小于等于i
            sum+=nums[i];
            //当sum第一次大于i时，那么前i个文章引用率一定都大于等于i，不再搜寻；第一次sum等于i时，也不用再搜寻；
            if(sum>=i) return i;
        }
        //最后返回啥无所谓
        return sum;
    }

II 

Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?

二分查找

public int hIndex(int[] citations) {
        if(citations==null || citations.length==0) return 0;
        int h=0, t=citations.length-1;
        while(h<=t){
            int m=h+(t-h)/2;
            int n = citations.length - m;
            if(n>citations[m]) h=m+1;
            else if(n<citations[m]) t=m-1;
            else if(n==citations[m]) return n;
        }
        //when h == t, it is the last time n<citations[m], so t=m-1 and break while loop
        return citations.length-t-1;
    }