点击打开链接
bool cmp(int& a, int& b)
{
return a>b;
}
class Solution {
public:
int hIndex(vector<int>& citations) {
sort(citations.begin(), citations.end(), cmp);
int i=0;
for(i=0;i<citations.size();i++){
if(i>= citations[i]) break;
}
return i;
}
};