这道题很简单!
class Solution {
public:
int hIndex(vector<int>& citations) {
auto cmp = [](int a,int b)
{
return a>b;
};
sort(citations.begin(),citations.end(),cmp);
int ans = 0;
for(int i = 0;i<citations.size();i++)
{
if(citations[i]>=i+1) ans = max(ans,i+1);
}
return ans;
}
};