LeetCode:H-Index II

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:

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


阅读更多
版权声明:本文为博主原创文章,转载请注明出处。 https://blog.csdn.net/itismelzp/article/details/51558339
文章标签: LeetCode Binary Search
个人分类: LeetCode OJ
所属专栏: LeetCode解题记录
上一篇LeetCode:Peeking Iterator
下一篇LeetCode:Balanced Binary Tree
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭