【二分查找】275. H指数 II

题目:

 

 

 

解答：

 

 

class Solution {
public:
    int hIndex(vector<int>& citations) 
    {
        int n = citations.size();

        int pivot;
        int left = 0;
        int right = citations.size() - 1;

        while (left <= right) 
        {
            pivot = left + (right - left) / 2;
            if (citations[pivot] == n - pivot) 
            {
                return n - pivot;
            }
            else if (citations[pivot] < n - pivot) 
            {
                left = pivot + 1;
            }
            else 
            {
                right = pivot - 1;
            }
        }
        return n - left;
    }
};