LeetCode 275 H-Index II

最新推荐文章于 2024-11-04 12:20:00 发布

_我们的存在

最新推荐文章于 2024-11-04 12:20:00 发布

阅读量554

点赞数 2

分类专栏： leetcode 文章标签： leetcode 二分查找 H-Index

本文链接：https://blog.csdn.net/Yano_nankai/article/details/50290639

版权

leetcode 专栏收录该内容

208 篇文章 0 订阅

订阅专栏

题目描述

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.

分析

二分查找

代码

    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;
    }