LeetCode:H-Index II

最新推荐文章于 2024-10-03 16:38:42 发布

walker lee

最新推荐文章于 2024-10-03 16:38:42 发布

阅读量2.5k

点赞数

分类专栏： LeetCode OJ LeetCode解题记录文章标签： LeetCode Binary Search

本文链接：https://blog.csdn.net/itismelzp/article/details/51558339

版权

LeetCode OJ 同时被 2 个专栏收录

216 篇文章 0 订阅

订阅专栏

LeetCode解题记录

216 篇文章 13 订阅

订阅专栏

H-Index II

Total Accepted: 24331 Total Submissions: 74459 Difficulty: Medium

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

Hint:

Expected runtime complexity is in O(log n) and the input is sorted.

Subscribe to see which companies asked this question

Hide Tags

Binary Search

Hide Similar Problems

(M) H-Index

思路：

承接上题【】，与上题不同之处在于已经是排序的，因此通过二分找到临界点即可。

java code:

public class Solution {
    public int hIndex(int[] citations) {
        
        if(citations == null || citations.length == 0) return 0;
        
        int len = citations.length;
        int lo = 0, hi = len-1;
        
        while(lo <= hi) {
            int mid = lo + (hi-lo)/2;
            
            if(citations[mid] == len - mid)
                return len-mid;
            else if(citations[mid] >= len - mid)
                hi = mid - 1;
            else 
                lo = mid + 1;
        }
        
        return len-lo;
    }
}