H-Index LeetCode solution in Python

1
class Solution:
2
    def hIndex(self, citations: List[int]) -> int:
3
        num = sorted(citations)
4
        h = 0
5
        j = len(num) - 1
6
        for i in range(len(num)):
7
            if i + 1 <= num[i] and j - i + 1 >= num[i]:
8
                h = max(num[i], h)
9
            elif i + 1 <= num[i] and j - i + 1 < num[i]:
10
                h = max(h, j - i + 1)
11
            elif i + 1 > num[i] and j - i + 1 >= num[i]:
12
                h = max(h, num[i])
13

14
        return h