关闭

LeetCode:H-Index II

标签: LeetCodeBinary Search
2259人阅读 评论(0) 收藏 举报
分类:

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


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:323822次
    • 积分:6121
    • 等级:
    • 排名:第4062名
    • 原创:310篇
    • 转载:1篇
    • 译文:0篇
    • 评论:22条
    博客专栏
    最新评论