LeetCode-274&275.H-Index

274 https://leetcode.com/problems/h-index/

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.

Hint:

1. An easy approach is to sort the array first.
2. What are the possible values of h-index?
3. A faster approach is to use extra space.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

方法1

比较直接的思路是对数组排序，然后根据定义遍历判断。算法复杂度O(n * logn) 排序 + O(n)遍历

int hIndex(vector<int>& citations)
    {
        int n = citations.size();
    	if (n == 0)
    		return 0;
    	sort(citations.begin(), citations.end());
    	for (int i = 0; i < n; i++)
    	{
    		if (n - i <= citations[i])
    			return n - i;
    	}
    	return 0;
    }

方法2

用n+1长的数组统计引用次数在0 - n（N篇以上的记为N）的文章个数

然后再计算h最大

int hIndex(vector<int>& citations)
    {
        int n = citations.size();
    	if (n == 0)
    		return 0;
    	int *h = new int[n+1]{0};
    	for (int i = 0; i < n; i++)
    	{
    		if (citations[i] > n)
    			h[n] += 1;
    		else
    			h[citations[i]] += 1;
    	}
    	int res = 0;
    	for (int i = n; i >=0; i--)
    	{
    		res += h[i];
    		if (res >= i)
    			return i;
    	}
    	return 0;
    }

275 https://leetcode.com/problems/h-index-ii/

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.

int hIndex(vector<int>& citations) 
{
	int n = citations.size();
	int l = 0, r = n - 1,m;
	while (l<=r)
	{
		m = (l + r) / 2;
		if (n - m == citations[m])
			return n - m;
		if (n - m > citations[m])
			l = m + 1;
		else
			r = m - 1;
	}
	return n - r - 1;
}

int hIndex(vector<int>& citations) 
    {
        int n = citations.size();
    	int l = 0, r = n - 1,m;
    	while (l<=r)
    	{
    		m = (l + r) / 2;
    		if (n - m > citations[m])
    			l = m + 1;
    		else
    			r = m - 1;
    	}
    	return n - l;
    }