H index II

最新推荐文章于 2020-12-04 20:01:57 发布

poiop221

最新推荐文章于 2020-12-04 20:01:57 发布

阅读量258

点赞数

分类专栏： leetcode fast

本文链接：https://blog.csdn.net/poiop221/article/details/48540867

版权

leetcode 同时被 2 个专栏收录

174 篇文章 0 订阅

订阅专栏

fast

57 篇文章 0 订阅

订阅专栏

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) {
        int len = citations.length;  
        int left = 0, right = len - 1;  
        while(left <= right){  
            int mid = left + (right - left) / 2;  
            if(citations[mid] == (len - mid)) return citations[mid];  
            else if (citations[mid] > (len - mid)) right = mid - 1;  
            else left = mid + 1;  
        }  
        return len - left;  
    }