[leetcode-275]H-Index II(java)

问题描述：
What if the citations array is sorted in ascending order? Could you optimize your algorithm?

分析：这道题比第一题更直观，而且可以省略排序的过程。所以直接从后向前搜索即可。这道题也可以使用二分查找的方法，如代码2
代码如下：320ms

public class Solution {
    public int hIndex(int[] citations) {
        int size = citations.length;
        if(size<=0)
            return 0;
         int count = 0;

        for(int i = size-1;i>=0;i--){
            if(count>=citations[i])
                return Math.max(count,citations[i]);
            count++;
        }
        return count;
    }
}

代码如下：300ms

public class Solution {
    public int hIndex(int[] citations) {
        int size = citations.length;
        if(size<=0)
            return 0;
         int count = 0;

        int start = 0;
        int end = size;
        while(start<end){
            int mid = (start+end)/2;
            count = size-mid;
            if(count>=citations[mid] && (mid+1>=size || count-1<citations[mid+1]))
                return Math.max(count-1,citations[mid]);
            else if(mid+1<size && count>=citations[mid+1]){
                start = mid;
            }else
                end = mid;
        }

        return count;
    }
}

更优美的二分查找代码如下：292ms

public class Solution {
    public int hIndex(int[] citations) {
        int n = citations.length;

        int low=0, high=n-1;

        while(low<=high) {
            int mid  = low + (high-low)/2;
            if(citations[mid] == n-mid) return n-mid;
            else if(citations[mid] < n-mid) low = mid+1;
            else high = mid-1;
        }
        return n-low;
    }
}