[leetcode 274 275]H-Index I II

274：

Given an array of citations (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."

For example, given citations = [3, 0, 6, 1, 5], which means the researcher has 5 papers in total and each of them had received 3, 0, 6, 1, 5 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, his h-index is 3.

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

275：

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.

给你一个数组，找到一个最大的N,其中在数组中有N个元素大于等于N.

看完I再看II你就知道方法了，排序，二分

274AC代码：

class Solution
{
public:
    int hIndex(vector<int>& citations)
    {
        int sum=citations.size();
        int left=0;
        int right=sum-1;
        sort(citations.begin(),citations.end());
        while(left<=right)
        {
            int mid=(right+left)/2;
            if(sum-mid==citations[mid])
                return sum-mid;
            else if(sum-mid<citations[mid])
                right=mid-1;
            else
                left=mid+1;
        }
        return sum-left;
    }
};

275AC代码：

class Solution {
public:
    int hIndex(vector<int>& citations) {
         int sum=citations.size();
        int left=0;
        int right=sum-1;
        while(left<=right)
        {
            int mid=(right+left)/2;
            if(sum-mid==citations[mid])
                return sum-mid;
            else if(sum-mid<citations[mid])
                right=mid-1;
            else
                left=mid+1;
        }
        return sum-left;
    }
};

其他leetcode题目AC代码： https://github.com/PoughER