H-Index II LeetCode solution in Java

1
class Solution {
2
  public int hIndex(int[] citations) {
3
    int n = citations.length;
4
    int res = 0;
5
    for (int i = 0; i < n; i++) {
6
      if (citations[i] >= n - i) {
7
        return n - i;
8
      }
9
    }
10
    return res;
11
  }
12
}