leetcode275

class Solution:
    def hIndex(self, citations):
        citations_len = len(citations)
        if citations_len<=0:
            return 0
        low = 0
        high = citations_len-1
        h_idx = 0
        while low <= high:
            mid = (low+high)//2
            if citations[mid] >= citations_len-mid:
                h_idx = citations_len-mid
                high = mid-1
            else:
                low = mid+1
        return h_idx

参考：https://leetcode.com/problems/h-index-ii/discuss/525117/Python-solution-binary-search

这题做起来感觉很糟。