[Leetcode] 275. H-Index II

这题其实就真的很没意思了，特别是在做过H-index之后。
两种做法，1.你就顺序遍历吧。就把https://blog.csdn.net/chaochen1407/article/details/81908199 解法一中的排序那一行去掉就好了。
2. 其实和https://blog.csdn.net/chaochen1407/article/details/81908199 解法二的理论差不多，就是把selection rank变成二分就好了。Follow up都已经给提示你了，logarithmic time除了二分还能是啥呢。

    public int hIndex(int[] citations) {
        int head = 0, tail = citations.length - 1;
        while (head <= tail) {
            int mid = (head + tail) / 2;
            int candidate = citations.length - mid;
            if (citations[mid] == candidate) return candidate;
            else if (citations[mid] > candidate) {
                tail = mid - 1;
            } else {
                head = mid + 1;
            }
        }
        
        return citations.length - head;
    }