class Solution {
public:
int hIndex(vector<int>& citations) {
sort(citations.begin(),citations.end());
int h = 0, n = citations.size() - 1;
//如果序号大于0,并且第n个数大于h,那么后面的数肯定大于h
while(n >= 0 && citations[n] > h){
h++;
n--;
}
return h;
}
};
Accepted
81/81 cases passed (0 ms)
Your runtime beats 100 % of cpp submissions
Your memory usage beats 77.44 % of cpp submissions (8.3 MB)