[LeetCode]H-Index II

最新推荐文章于 2021-07-11 18:37:44 发布

在风雨中奔跑

最新推荐文章于 2021-07-11 18:37:44 发布

阅读量349

点赞数

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/zxdfc/article/details/48738101

版权

leetcode 专栏收录该内容

38 篇文章

订阅专栏

本文探讨了在已排序的引用数组中优化计算H-指数的算法，提出了一个具有O(log n)复杂度的解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

参考： http://m.blog.youkuaiyun.com/blog/RIVIERA613/48251161

code：

public class Solution {
    public int hIndex(int[] citations) {
        	
	int n = citations.length;
		int left = 0, right = n-1;
		
		int mid=0;
		while(left<=right){
			
			mid = left+(right-left)/2;
			if(citations[mid] == n-mid)
				return n-mid;
			else if(citations[mid]<n-mid){
				left = mid+1;
			}else
				right = mid-1;
		}
		return n-left;
    }
}