H-Index LeetCode solution in C++

1
class Solution {
2
public:
3
int hIndex(vector<int> &citations) {
4
sort(citations.begin(), citations.end(), greater<int>());
5
int ans = 0;
6
for (int i = 0; i < citations.size(); i++) {
7
if (citations[i] >= i + 1) ans = i + 1;
8
}
9
return ans;
10
}
11
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0