LeetCode 275. H-Index II

最新推荐文章于 2022-02-03 00:33:37 发布

ov大鱼vo

最新推荐文章于 2022-02-03 00:33:37 发布

阅读量197

点赞数

分类专栏： LeetCode Java

本文链接：https://blog.csdn.net/flowingfog/article/details/87872776

版权

LeetCode 同时被 2 个专栏收录

77 篇文章 0 订阅

订阅专栏

Java

24 篇文章 0 订阅

订阅专栏

分析

难度中
来源 https://leetcode.com/problems/h-index-ii/

题目

Given an array of citations sorted in ascending order (each citation is a non-negative integer) of a researcher, write a function to compute the researcher’s h-index.
According to the definition of h-index on Wikipedia: “A scientist has index h if h of his/her N papers have at least h citations each, and the other N − h papers have no more than h citations each.”

Example:

Input:

citations = [0,1,3,5,6]

Output:

Explanation:

[0,1,3,5,6] means the researcher has 5 papers in total and each of them had received 0, 1, 3, 5, 6 citations respectively. Since the researcher has 3 papers with at least 3 citations each and the remaining two with no more than 3 citations each, her h-index is 3.

Note:

If there are several possible values for h, the maximum one is taken as the h-index.

Follow up:

This is a follow up problem to H-Index, where citations is now
guaranteed to be sorted in ascending order.
Could you solve it in logarithmic time complexity?

解答

Runtime: 3 ms, faster than 100.00% of Java online submissions for H-Index II.
Memory Usage: 42.7 MB, less than 32.00% of Java online submissions for H-Index II.

package LeetCode;

public class L275_H_IndexII {
/*    public int hIndex(int[] citations) {//二分查找
        //citations[index] >= length(citations) - index.
        //And return (length - index) as the result.
        int len=citations.length;
        int low=0,high=len-1,mid=0;//mid作为数组的指针，而不是引用数
        while(low<=high) {
            mid = low + (high - low) / 2;
            if (citations[mid]==len-mid) {//比较时，引用数组的起始下标为1
                return len-mid;
            }else if(citations[mid]>len-mid)//len-mid要加，mid要减
                high = mid - 1;//查左半部
            else
                low = mid + 1;//查左半部

        }
        //return len-mid;
        return len-low;//为啥是len-low不是len-mid嘞？此时不存在citations[mid]==len-mid，找citations[index]>lenth(citations)-index的最小index，即最大lenth(citations)-index。左侧咯
    }*/
    /*
    Runtime: 2 ms, faster than 100.00% of Java online submissions for H-Index II.
Memory Usage: 42.7 MB, less than 32.00% of Java online submissions for H-Index II.
     */
    public int hIndex(int[] citations) {
        int len=citations.length;
        int i;
        for(i=0;i<len;i++){
            if(i+1<=citations[len-1-i]) {
                continue;
            }else
                break;
        }
        return i--;
    }
    public static void main(String[] args){
        L275_H_IndexII l275=new L275_H_IndexII();
        //int[]  citations = {3,0,6,1,5};
        //int[]  citations = {0,1,3,5,6};//期望输出，3
        //int[]  citations = {10,8,5,4,3};//期望输出 4
        //int[]  citations = {3,4,5,8,10};
        //int[]  citations = {25,8,5,3,3};//期望输出 3
        int[]  citations = {3,3,5,8,25};//期望输出 3
        //int[]  citations = {100};//期望输出 1
        System.out.println(l275.hIndex(citations));
    }
}